Recognised as Number
4,108,602,470,721
- Positive
- Odd
- Composite
- 13 digits
4,108,602,470,721 is an odd 13-digit integer and a composite number. It has 64 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value4,108,602,470,721
Digit count13
Digit sum42
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3 × 7 × 83 × 467 × 1,321 × 3,821
Distinct prime factors63, 7, 83, 467, 1,321, 3,821
Number of divisors64
Sum of divisors σ(n)6,356,195,629,056
Aliquot sum2,247,593,158,335sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,312,162,265,600integers below n that share no factor with it
Carmichael function λ(n)2,408,502,360the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,312,162,265,600
Möbius function μ(n)+16 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 83, 249, 467, 581, 1,321, 1,401, 1,743, 3,269, 3,821, 3,963, 9,247, 9,807, 11,463, 26,747, 27,741, 38,761, 80,241, 109,643, 116,283, 271,327, 317,143, 328,929, 616,907, 767,501, 813,981, 951,429, 1,784,407, 1,850,721, 2,220,001, 2,302,503, 4,318,349, 5,047,541, 5,353,221, 6,660,003, 12,490,849, 12,955,047, 15,142,623, 35,332,787, 37,472,547, 51,203,281, 105,998,361, 148,105,781, 153,609,843, 358,422,967, 418,945,903, 444,317,343, 1,036,740,467, 1,075,268,901, 1,256,837,709, 2,357,201,647, 2,932,621,321, 3,110,221,401, 7,071,604,941, 8,797,863,963, 16,500,411,529, 49,501,234,587, 195,647,736,701, 586,943,210,103, 1,369,534,156,907, 4,108,602,470,72164 in total
Arithmetic
Previous number4,108,602,470,720
Next number4,108,602,470,722
Double8,217,204,941,442
Square16,880,614,262,414,705,662,259,841
Cube69,355,733,465,845,210,731,484,771,296,896,615,361
Square root2,026,968.78878808≈irrational, shown to 9 decimal places
Cube root16,016.392666379≈
Negation-4,108,602,470,721
Reciprocal2.43391763 × 10^-13≈
Representations
Decimal4,108,602,470,721
Binary11101111001001101111001010011100010100000142 bits
Octal73623362470501
Hexadecimal3BC9BCA7141
Base 361GFGRTVSX
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour trillion, one hundred and eight billion, six hundred and two million, four hundred and seventy thousand, seven hundred and twenty-one
Ordinalfour trillion, one hundred and eight billion, six hundred and two million, four hundred and seventy thousand, seven hundred and twenty-first
Scientific notation4.10860247 × 10^12
Engineering notation4.108602 × 10^12
In other bases
Ternary112112210000120101211112120base 3; the most digit-efficient integer base after e: 27 digits
Quinary1014303404213030341base 5; one hand: 19 digits
Septenary602556666531150base 7: 15 digits
Nonary15483016354476base 9; each digit is two ternary digits: 14 digits
Duodecimal5643367a2a29base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal809gi58gg1base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal1:28:3:41:47:44:5:21base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1TT0TT0T10001TT011T0TTTT0TT0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001100110111101100110111111011000101000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000111011110010011011110010100111000101000001
Bit length42 bitsto write the magnitude
Set bits22the population count, or Hamming weight
Zero bits20within that length
Bit parityeven22 set bits, so even; not the same as the number itself being odd
Highest set bitbit 41worth 2,199,023,255,552
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes603 bc 9b ca 71 41
Gray code100110001011010110001011110100100111100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000111011110010011011110010100111000101000001
One's complement1111111111111111111111000100001101100100001101011000111010111110at 64 bits, every bit flipped
Bits reversed1000001010001110010100111101100100111101110000000000000000000000at 64 bits
Rotated left by 10000000000000000000001110111100100110111100101001110001010000010at 64 bits, wrapping
Shifted left by 11110111100100110111100101001110001010000010= 8,217,204,941,442, no wrap
Shifted right by 111101111001001101111001010011100010100000= 2,054,301,235,360, discarding the low bit
These bits as a double2.02991933 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime16
Nearest square below4,108,599,273,024
Nearest square above4,108,603,326,961
Powers & multiples
4,108,602,470,721 to the power 216,880,614,262,414,705,662,259,841
4,108,602,470,721 to the power 369,355,733,465,845,210,731,484,771,296,896,615,361
4,108,602,470,721 to the power 4284955137876438777277923235055… (51 digits)
4,108,602,470,721 to the power 5117076738352377956953676763843… (64 digits)
First ten multiples4,108,602,470,721, 8,217,204,941,442, 12,325,807,412,163, 16,434,409,882,884, 20,543,012,353,605, 24,651,614,824,326, 28,760,217,295,047, 32,868,819,765,768, 36,977,422,236,489, 41,086,024,707,210
Powers of twoBetween 2^41 (2,199,023,255,552) and 2^42 (4,398,046,511,104)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 1
Divisible by 9No, remainder 6
Divisible by 10No, remainder 1
Divisible by 11No, remainder 1
Divisible by 12No, remainder 9
Divisible by 100No, remainder 21
Collatz (3n + 1) trajectory
Steps to reach 1298the total stopping time
Highest value reached12,325,807,412,1643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,108,602,470,721 → 12,325,807,412,164 → 6,162,903,706,082 → 3,081,451,853,041 → 9,244,355,559,124 → 4,622,177,779,562 → 2,311,088,889,781 → 6,933,266,669,344 → 3,466,633,334,672 → 1,733,316,667,336 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage410,860,247,072,100%
4,108,602,470,721% as a decimal41,086,024,707.21
4,108,602,470,721% of 1004,108,602,470,721
4,108,602,470,721% of 1,00041,086,024,707,210
As a fraction of 1004,108,602,470,721/100
Read another way
As seconds130,193 years, 276 days and 2 hours
As bytes3.737 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,108,602,470,721
Nearby primes
Also reads as
4108602470721 (identifier)
- 13 characters
- Checksum fails
4108602470721 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