Recognised as Number
4,913,735,270,472
- Positive
- Even
- Composite
- 13 digits
4,913,735,270,472 is an even 13-digit integer and a composite number. It has 96 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value4,913,735,270,472
Digit count13
Digit sum54
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^3 × 3^2 × 7 × 347 × 28,096,469
Distinct prime factors52, 3, 7, 347, 28,096,469
Number of divisors96
Sum of divisors σ(n)15,253,011,633,600
Aliquot sum10,339,276,363,128sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,399,878,421,632integers below n that share no factor with it
Carmichael function λ(n)14,582,066,892the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,399,878,421,632
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 7, 8, 9, 12, 14, 18, 21, 24, 28, 36, 42, 56, 63, 72, 84, 126, 168, 252, 347, 504, 694, 1,041, 1,388, 2,082, 2,429, 2,776, 3,123, 4,164, 4,858, 6,246, 7,287, 8,328, 9,716, 12,492, 14,574, 19,432, 21,861, 24,984, 29,148, 43,722, 58,296, 87,444, 174,888, 28,096,469, 56,192,938, 84,289,407, 112,385,876, 168,578,814, 196,675,283, 224,771,752, 252,868,221, 337,157,628, 393,350,566, 505,736,442, 590,025,849, 674,315,256, 786,701,132, 1,011,472,884, 1,180,051,698, 1,573,402,264, 1,770,077,547, 2,022,945,768, 2,360,103,396, 3,540,155,094, 4,720,206,792, 7,080,310,188, 9,749,474,743, 14,160,620,376, 19,498,949,486, 29,248,424,229, 38,997,898,972, 58,496,848,458, 68,246,323,201, 77,995,797,944, 87,745,272,687, 116,993,696,916, 136,492,646,402, 175,490,545,374, 204,738,969,603, 233,987,393,832, 272,985,292,804, 350,981,090,748, 409,477,939,206, 545,970,585,608, 614,216,908,809, 701,962,181,496, 818,955,878,412, 1,228,433,817,618, 1,637,911,756,824, 2,456,867,635,236, 4,913,735,270,47296 in total
Arithmetic
Previous number4,913,735,270,471
Next number4,913,735,270,473
Double9,827,470,540,944
Square24,144,794,308,280,538,995,102,784
Cube118,641,127,390,889,680,428,355,321,421,680,194,048
Square root2,216,694.67236063≈irrational, shown to 9 decimal places
Cube root17,000.848020525≈
Negation-4,913,735,270,472
Reciprocal2.03511167 × 10^-13≈
Representations
Decimal4,913,735,270,472
Binary100011110000001000101110010000000000100100043 bits
Octal107402134400110
Hexadecimal47811720048
Base 361QPC74020
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsfour trillion, nine hundred and thirteen billion, seven hundred and thirty-five million, two hundred and seventy thousand, four hundred and seventy-two
Ordinalfour trillion, nine hundred and thirteen billion, seven hundred and thirty-five million, two hundred and seventy thousand, four hundred and seventy-second
Scientific notation4.91373527 × 10^12
Engineering notation4.913735 × 10^12
In other bases
Ternary122101202012122210211002200base 3; the most digit-efficient integer base after e: 27 digits
Quinary1121001312212123342base 5; one hand: 19 digits
Septenary1015001640442020base 7: 16 digits
Nonary18352178724080base 9; each digit is two ternary digits: 14 digits
Duodecimal674394000060base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal9bih258g3cbase 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal1:45:19:6:14:24:1:12base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary1T0T11TT1T1T0T00T11T11010T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1011000100000010110101101100000000001011000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000001000111100000010001011100100000000001001000
Bit length43 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits30within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 42worth 4,398,046,511,104
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes604 78 11 72 00 48
Gray code1100100010000011001110010110000000001101100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000001000111100000010001011100100000000001001000
One's complement1111111111111111111110111000011111101110100011011111111110110111at 64 bits, every bit flipped
Bits reversed0001001000000000010011101000100000011110001000000000000000000000at 64 bits
Rotated left by 10000000000000000000010001111000000100010111001000000000010010000at 64 bits, wrapping
Shifted left by 110001111000000100010111001000000000010010000= 9,827,470,540,944, no wrap
Shifted right by 1100011110000001000101110010000000000100100= 2,456,867,635,236, discarding the low bit
These bits as a double2.42770779 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime23
Nearest square below4,913,732,289,636
Nearest square above4,913,736,723,025
Powers & multiples
4,913,735,270,472 to the power 224,144,794,308,280,538,995,102,784
4,913,735,270,472 to the power 3118,641,127,390,889,680,428,355,321,421,680,194,048
4,913,735,270,472 to the power 4582971092189176311528338180124… (51 digits)
4,913,735,270,472 to the power 5286456561735553950971859413920… (64 digits)
First ten multiples4,913,735,270,472, 9,827,470,540,944, 14,741,205,811,416, 19,654,941,081,888, 24,568,676,352,360, 29,482,411,622,832, 34,396,146,893,304, 39,309,882,163,776, 44,223,617,434,248, 49,137,352,704,720
Powers of twoBetween 2^42 (4,398,046,511,104) and 2^43 (8,796,093,022,208)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12Yes
Divisible by 100No, remainder 72
Collatz (3n + 1) trajectory
Steps to reach 1319the total stopping time
Highest value reached4,913,735,270,472
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps4,913,735,270,472 → 2,456,867,635,236 → 1,228,433,817,618 → 614,216,908,809 → 1,842,650,726,428 → 921,325,363,214 → 460,662,681,607 → 1,381,988,044,822 → 690,994,022,411 → 2,072,982,067,234 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage491,373,527,047,200%
4,913,735,270,472% as a decimal49,137,352,704.72
4,913,735,270,472% of 1004,913,735,270,472
4,913,735,270,472% of 1,00049,137,352,704,720
As a fraction of 1004,913,735,270,472/100
Read another way
As seconds155,706 years, 319 days and 12 hours
As bytes4.469 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,913,735,270,472
Nearby primes
Also reads as
4913735270472 (identifier)
- 13 characters
- Checksum valid
4913735270472 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). The check digit is valid for Luhn (cards, IMEI). 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 validmod 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