Recognised as Number

51,999,999,973

Positive
Odd
Prime
11 digits

51,999,999,973 is an odd 11-digit integer and a prime number. It has 2 divisors and a digital root of 7.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value51,999,999,973

Digit count11

Digit sum79

Digit product502,211,745

Multiplicative persistence2times the digit product can be taken before one digit is left

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation51,999,999,973

Distinct prime factors151,999,999,973

Number of divisors2

Sum of divisors σ(n)51,999,999,974

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)51,999,999,972integers below n that share no factor with it

Carmichael function λ(n)51,999,999,972the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 51,999,999,9732 in total

Arithmetic

Previous number51,999,999,972

Next number51,999,999,974

Double103,999,999,946

Half25,999,999,986.5

Square2,703,999,997,192,000,000,729

Cube140,607,999,780,976,000,113,723,999,980,317

Square root228,035.084960626≈irrational, shown to 9 decimal places

Cube root3,732.511156171≈

Negation-51,999,999,973

Reciprocal1.92307692 × 10^-11≈

Representations

Decimal51,999,999,973

Binary11000001101101110001000001111110010136 bits

Octal603334203745

HexadecimalC1B7107E5

Base 36NVZGGRP

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

In wordsfifty-one billion, nine hundred and ninety-nine million, nine hundred and ninety-nine thousand, nine hundred and seventy-three

Ordinalfifty-one billion, nine hundred and ninety-nine million, nine hundred and ninety-nine thousand, nine hundred and seventy-third

Scientific notation5.2 × 10^10

Engineering notation52 × 10^9

In other bases

Ternary11222012222011200210221base 3; the most digit-efficient integer base after e: 23 digits

Quinary1322443444444343base 5; one hand: 16 digits

Septenary3520415464315base 7: 13 digits

Nonary158188150727base 9; each digit is two ternary digits: 12 digits

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

Vigesimal20c9jjjidbase 20; hands and feet, and the Mayan and Yoruba systems: 9 digits

Sexagesimal1:6:52:20:44:26:13base 60; Babylonian, and still how an hour and a circle are divided: 7 digits

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

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

Bit-level

0000000000000000000000000000110000011011011100010000011111100101

Bit length36 bitsto write the magnitude

Set bits18the population count, or Hamming weight

Zero bits18within that length

Bit parityeven18 set bits, so even; not the same as the number itself being odd

Highest set bitbit 35worth 34,359,738,368

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes50c 1b 71 07 e5

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

At each machine width

64-bit0000000000000000000000000000110000011011011100010000011111100101

One's complement1111111111111111111111111111001111100100100011101111100000011010at 64 bits, every bit flipped

Bits reversed1010011111100000100011101101100000110000000000000000000000000000at 64 bits

Rotated left by 10000000000000000000000000001100000110110111000100000111111001010at 64 bits, wrapping

Shifted left by 11100000110110111000100000111111001010= 103,999,999,946, no wrap

Shifted right by 111000001101101110001000001111110010= 25,999,999,986, discarding the low bit

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

Nearest landmarks

Next prime52,000,000,009+36

Previous prime51,999,999,971−2

Distance to nearest prime0, it is prime

Nearest square below51,999,961,225

Nearest square above52,000,417,296

Powers & multiples

51,999,999,973 to the power 22,703,999,997,192,000,000,729

51,999,999,973 to the power 3140,607,999,780,976,000,113,723,999,980,317

51,999,999,973 to the power 4731161598481433601182729599590… (43 digits)

51,999,999,973 to the power 5380204031012931841025032319467… (54 digits)

First ten multiples51,999,999,973, 103,999,999,946, 155,999,999,919, 207,999,999,892, 259,999,999,865, 311,999,999,838, 363,999,999,811, 415,999,999,784, 467,999,999,757, 519,999,999,730

Powers of twoBetween 2^35 (34,359,738,368) and 2^36 (68,719,476,736)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 5

Divisible by 8No, remainder 5

Divisible by 9No, remainder 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 9

Divisible by 12No, remainder 1

Divisible by 100No, remainder 73

Collatz (3n + 1) trajectory

Steps to reach 1253the total stopping time

Highest value reached155,999,999,9203× the starting value

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

First steps51,999,999,973 → 155,999,999,920 → 77,999,999,960 → 38,999,999,980 → 19,499,999,990 → 9,749,999,995 → 29,249,999,986 → 14,624,999,993 → 43,874,999,980 → 21,937,499,990 → …

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

As a percentage & fraction

As a percentage5,199,999,997,300%

51,999,999,973% as a decimal519,999,999.73

51,999,999,973% of 10051,999,999,973

51,999,999,973% of 1,000519,999,999,730

As a fraction of 10051,999,999,973/100

Read another way

As seconds1,647 years, 285 days and 2 hours

As bytes48.429 GiB

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.