Recognised as Number

4,902,438,081,025

Positive
Odd
Composite
Perfect square
13 digits

4,902,438,081,025 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,902,438,081,025

Digit count13

Digit sum46

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,214,145²

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5^2 × 442,829^2

Distinct prime factors25, 442,829

Number of divisors9

Sum of divisors σ(n)6,079,036,948,201

Aliquot sum1,176,598,867,176sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)3,921,941,608,240integers below n that share no factor with it

Carmichael function λ(n)980,485,402,060the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 3,921,941,608,240

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 5, 25, 442,829, 2,214,145, 11,070,725, 196,097,523,241, 980,487,616,205, 4,902,438,081,0259 in total

Arithmetic

Previous number4,902,438,081,024

Next number4,902,438,081,026

Double9,804,876,162,050

Half2,451,219,040,512.5

Square24,033,899,138,284,084,465,050,625

Cube117,824,702,371,037,828,156,141,799,704,476,890,625

Square root2,214,145exact

Cube root16,987.809115728≈

Negation-4,902,438,081,025

Reciprocal2.03980139 × 10^-13≈

Representations

Decimal4,902,438,081,025

Binary100011101010111000000010100100100100000000143 bits

Octal107256005111001

Hexadecimal47570149201

Base 361QK5D20W1

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsfour trillion, nine hundred and two billion, four hundred and thirty-eight million, eighty-one thousand and twenty-five

Ordinalfour trillion, nine hundred and two billion, four hundred and thirty-eight million, eighty-one thousand and twenty-fifth

Scientific notation4.90243808 × 10^12

Engineering notation4.902438 × 10^12

In other bases

Ternary122100200001100011010120201base 3; the most digit-efficient integer base after e: 27 digits

Quinary1120310143122043100base 5; one hand: 19 digits

Septenary1014121662063442base 7: 16 digits

Nonary18320040133521base 9; each digit is two ternary digits: 14 digits

Duodecimal672160716801base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits

Vigesimal9ba0bi02b5base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits

Sexagesimal1:45:4:34:32:35:50:25base 60; Babylonian, and still how an hour and a circle are divided: 8 digits

Balanced ternary1T0T101T00001100011011TT1T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary1011000101010110000000101011001011000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0000000000000000000001000111010101110000000101001001001000000001

Bit length43 bitsto write the magnitude

Set bits15the population count, or Hamming weight

Zero bits28within that length

Bit parityodd15 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 75 70 14 92 01

Gray code1100100111111001000000111101101101100000001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit0000000000000000000001000111010101110000000101001001001000000001

One's complement1111111111111111111110111000101010001111111010110110110111111110at 64 bits, every bit flipped

Bits reversed1000000001001001001010000000111010101110001000000000000000000000at 64 bits

Rotated left by 10000000000000000000010001110101011100000001010010010010000000010at 64 bits, wrapping

Shifted left by 110001110101011100000001010010010010000000010= 9,804,876,162,050, no wrap

Shifted right by 1100011101010111000000010100100100100000000= 2,451,219,040,512, discarding the low bit

These bits as a double2.42212624 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime4,902,438,081,053+28

Previous prime4,902,438,081,017−8

Distance to nearest prime8

Nearest square below4,902,438,081,025

Nearest square above4,902,442,509,316

Powers & multiples

4,902,438,081,025 to the power 224,033,899,138,284,084,465,050,625

4,902,438,081,025 to the power 3117,824,702,371,037,828,156,141,799,704,476,890,625

4,902,438,081,025 to the power 4577628307789212457803479518611… (51 digits)

4,902,438,081,025 to the power 5283178701278386478183011391778… (64 digits)

First ten multiples4,902,438,081,025, 9,804,876,162,050, 14,707,314,243,075, 19,609,752,324,100, 24,512,190,405,125, 29,414,628,486,150, 34,317,066,567,175, 39,219,504,648,200, 44,121,942,729,225, 49,024,380,810,250

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 5Yes

Divisible by 6No, remainder 1

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 5

Divisible by 11No, remainder 1

Divisible by 12No, remainder 1

Divisible by 100No, remainder 25

Collatz (3n + 1) trajectory

Steps to reach 1319the total stopping time

Highest value reached14,707,314,243,0763× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps4,902,438,081,025 → 14,707,314,243,076 → 7,353,657,121,538 → 3,676,828,560,769 → 11,030,485,682,308 → 5,515,242,841,154 → 2,757,621,420,577 → 8,272,864,261,732 → 4,136,432,130,866 → 2,068,216,065,433 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage490,243,808,102,500%

4,902,438,081,025% as a decimal49,024,380,810.25

4,902,438,081,025% of 1004,902,438,081,025

4,902,438,081,025% of 1,00049,024,380,810,250

As a fraction of 1004,902,438,081,025/100

Read another way

As seconds155,348 years, 324 days and 11 hours

As bytes4.459 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,902,438,081,025

Nearby primes

4902438081025 (identifier)

13 characters
Checksum valid

4902438081025 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). The check digit is valid for ISBN-13 / EAN-13. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.

Open this reading on its own page →

Checksum tests

ISBN-13 / EAN-13Check digit validmod 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