Recognised as Number
49,484,907,771,601
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
49,484,907,771,601 is an odd 14-digit integer and a composite number. It has 27 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value49,484,907,771,601
Digit count14
Digit sum67
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 7,034,551²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation31^2 × 37^2 × 6,133^2
Distinct prime factors331, 37, 6,133
Number of divisors27
Sum of divisors σ(n)52,560,573,324,273
Aliquot sum3,075,665,552,672sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)46,586,736,070,560integers below n that share no factor with it
Carmichael function λ(n)647,038,000,980the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 46,586,736,070,560
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 31, 37, 961, 1,147, 1,369, 6,133, 35,557, 42,439, 190,123, 226,921, 1,315,609, 5,893,813, 7,034,551, 8,396,077, 37,613,689, 218,071,081, 260,278,387, 1,166,024,359, 1,391,706,493, 8,068,629,997, 36,146,755,129, 43,142,901,283, 51,493,140,241, 1,337,429,939,773, 1,596,287,347,471, 49,484,907,771,60127 in total
Arithmetic
Previous number49,484,907,771,600
Next number49,484,907,771,602
Double98,969,815,543,202
Square2,448,756,097,163,857,047,582,103,201
Cube121,176,469,623,299,083,088,624,213,537,285,718,994,801
Square root7,034,551exact
Cube root36,713.370328957≈
Negation-49,484,907,771,601
Reciprocal2.02081815 × 10^-14≈
Representations
Decimal49,484,907,771,601
Binary101101000000011001101001011001011101101101000146 bits
Octal1320063226273321
Hexadecimal2D019A5976D1
Base 36HJH1WFAHD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsforty-nine trillion, four hundred and eighty-four billion, nine hundred and seven million, seven hundred and seventy-one thousand, six hundred and one
Ordinalforty-nine trillion, four hundred and eighty-four billion, nine hundred and seven million, seven hundred and seventy-one thousand, six hundred and first
Scientific notation4.94849078 × 10^13
Engineering notation49.484908 × 10^12
In other bases
Ternary20111012201012022020220122011base 3; the most digit-efficient integer base after e: 29 digits
Quinary22441230042342142401base 5; one hand: 20 digits
Septenary13265111100625531base 7: 17 digits
Nonary214181168226564base 9; each digit is two ternary digits: 15 digits
Duodecimal567260b5a4a41base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimal4gd01ddb901base 20; hands and feet, and the Mayan and Yoruba systems: 11 digits
Sexagesimal17:40:37:59:55:14:20:1base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1T01111T0T011TT10T1T10T1T0T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111010000011011101111101011101000101111010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000001011010000000110011010010110010111011011010001
Bit length46 bitsto write the magnitude
Set bits22the population count, or Hamming weight
Zero bits24within that length
Bit parityeven22 set bits, so even; not the same as the number itself being odd
Highest set bitbit 45worth 35,184,372,088,832
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes62d 01 9a 59 76 d1
Gray code1110111000000101010111011101011100110110111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000001011010000000110011010010110010111011011010001
One's complement1111111111111111110100101111111001100101101001101000100100101110at 64 bits, every bit flipped
Bits reversed1000101101101110100110100101100110000000101101000000000000000000at 64 bits
Rotated left by 10000000000000000010110100000001100110100101100101110110110100010at 64 bits, wrapping
Shifted left by 110110100000001100110100101100101110110110100010= 98,969,815,543,202, no wrap
Shifted right by 1101101000000011001101001011001011101101101000= 24,742,453,885,800, discarding the low bit
These bits as a double2.44487929 × 10^-310≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime12
Nearest square below49,484,907,771,601
Nearest square above49,484,921,840,704
Powers & multiples
49,484,907,771,601 to the power 22,448,756,097,163,857,047,582,103,201
49,484,907,771,601 to the power 3121176469623299083088624213537… (42 digits)
49,484,907,771,601 to the power 4599640642339716529763303777510… (55 digits)
49,484,907,771,601 to the power 5296731618822844541516674335247… (69 digits)
First ten multiples49,484,907,771,601, 98,969,815,543,202, 148,454,723,314,803, 197,939,631,086,404, 247,424,538,858,005, 296,909,446,629,606, 346,394,354,401,207, 395,879,262,172,808, 445,364,169,944,409, 494,849,077,716,010
Powers of twoBetween 2^45 (35,184,372,088,832) and 2^46 (70,368,744,177,664)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1405the total stopping time
Highest value reached148,454,723,314,8043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps49,484,907,771,601 → 148,454,723,314,804 → 74,227,361,657,402 → 37,113,680,828,701 → 111,341,042,486,104 → 55,670,521,243,052 → 27,835,260,621,526 → 13,917,630,310,763 → 41,752,890,932,290 → 20,876,445,466,145 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage4.94849078 × 10^15%
49,484,907,771,601% as a decimal494,849,077,716.01
49,484,907,771,601% of 10049,484,907,771,601
49,484,907,771,601% of 1,000494,849,077,716,010
As a fraction of 10049,484,907,771,601/100
Read another way
As seconds1,568,082 years, 37 days and 14 hours
As bytes45.006 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 49,484,907,771,601
Nearby primes
Also reads as
49484907771601 (identifier)
- 14 characters
- Checksum fails
49484907771601 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-14 (case/carton)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page