Recognised as Number
4,640,745,669,121
- Positive
- Odd
- Composite
- Perfect square
- 13 digits
4,640,745,669,121 is an odd 13-digit integer and a composite number. It has 9 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,640,745,669,121
Digit count13
Digit sum55
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 2,154,239²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation19^2 × 113,381^2
Distinct prime factors219, 113,381
Number of divisors9
Sum of divisors σ(n)4,897,893,890,883
Aliquot sum257,148,221,762sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)4,396,457,120,760integers below n that share no factor with it
Carmichael function λ(n)2,198,228,560,380the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 4,396,457,120,760
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 19, 361, 113,381, 2,154,239, 40,930,541, 12,855,251,161, 244,249,772,059, 4,640,745,669,1219 in total
Arithmetic
Previous number4,640,745,669,120
Next number4,640,745,669,122
Double9,281,491,338,242
Square21,536,520,365,465,318,012,912,641
Cube99,945,513,613,969,390,702,353,328,275,664,258,561
Square root2,154,239exact
Cube root16,679.995252143≈
Negation-4,640,745,669,121
Reciprocal2.15482612 × 10^-13≈
Representations
Decimal4,640,745,669,121
Binary100001110001000000111111111010000100000000143 bits
Octal103420177641001
Hexadecimal43881FF4201
Base 361N7XG5FK1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour trillion, six hundred and forty billion, seven hundred and forty-five million, six hundred and sixty-nine thousand, one hundred and twenty-one
Ordinalfour trillion, six hundred and forty billion, seven hundred and forty-five million, six hundred and sixty-nine thousand, one hundred and twenty-first
Scientific notation4.64074567 × 10^12
Engineering notation4.640746 × 10^12
In other bases
Ternary121102122120112201012122201base 3; the most digit-efficient integer base after e: 27 digits
Quinary1102013221342402441base 5; one hand: 19 digits
Septenary656166001222312base 7: 15 digits
Nonary17378515635581base 9; each digit is two ternary digits: 14 digits
Duodecimal62b4a8402801base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal915bd08cg1base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal1:39:28:2:13:39:12:1base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1TT1110T00TT1TT0T011T0T00T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1000100100110000110000000110100011000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000001000011100010000001111111110100001000000001
Bit length43 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits26within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 42worth 4,398,046,511,104
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes604 38 81 ff 42 01
Gray code1100010010011000001000000001110001100000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000001000011100010000001111111110100001000000001
One's complement1111111111111111111110111100011101111110000000001011110111111110at 64 bits, every bit flipped
Bits reversed1000000001000010111111111000000100011100001000000000000000000000at 64 bits
Rotated left by 10000000000000000000010000111000100000011111111101000010000000010at 64 bits, wrapping
Shifted left by 110000111000100000011111111101000010000000010= 9,281,491,338,242, no wrap
Shifted right by 1100001110001000000111111111010000100000000= 2,320,372,834,560, discarding the low bit
These bits as a double2.29283301 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime6
Nearest square below4,640,745,669,121
Nearest square above4,640,749,977,600
Powers & multiples
4,640,745,669,121 to the power 221,536,520,365,465,318,012,912,641
4,640,745,669,121 to the power 399,945,513,613,969,390,702,353,328,275,664,258,561
4,640,745,669,121 to the power 4463821709452102394947805372578… (51 digits)
4,640,745,669,121 to the power 5215247858938414297914225965363… (64 digits)
First ten multiples4,640,745,669,121, 9,281,491,338,242, 13,922,237,007,363, 18,562,982,676,484, 23,203,728,345,605, 27,844,474,014,726, 32,485,219,683,847, 37,125,965,352,968, 41,766,711,022,089, 46,407,456,691,210
Powers of twoBetween 2^42 (4,398,046,511,104) and 2^43 (8,796,093,022,208)
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 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1298the total stopping time
Highest value reached13,922,237,007,3643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,640,745,669,121 → 13,922,237,007,364 → 6,961,118,503,682 → 3,480,559,251,841 → 10,441,677,755,524 → 5,220,838,877,762 → 2,610,419,438,881 → 7,831,258,316,644 → 3,915,629,158,322 → 1,957,814,579,161 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage464,074,566,912,100%
4,640,745,669,121% as a decimal46,407,456,691.21
4,640,745,669,121% of 1004,640,745,669,121
4,640,745,669,121% of 1,00046,407,456,691,210
As a fraction of 1004,640,745,669,121/100
Read another way
As seconds147,056 years, 130 days and 3 hours
As bytes4.221 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 4,640,745,669,121
Nearby primes
Also reads as
4640745669121 (identifier)
- 13 characters
- Checksum fails
4640745669121 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). 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
ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
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