Recognised as Number
790,153,876,837
- Positive
- Odd
- Composite
- 12 digits
790,153,876,837 is an odd 12-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value790,153,876,837
Digit count12
Digit sum64
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
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation13 × 157 × 387,140,557
Distinct prime factors313, 157, 387,140,557
Number of divisors8
Sum of divisors σ(n)856,354,914,296
Aliquot sum66,201,037,459sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)724,727,120,832integers below n that share no factor with it
Carmichael function λ(n)5,032,827,228the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 724,727,120,832
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 13, 157, 2,041, 387,140,557, 5,032,827,241, 60,781,067,449, 790,153,876,8378 in total
Arithmetic
Previous number790,153,876,836
Next number790,153,876,838
Double1,580,307,753,674
Square624,343,149,080,540,965,124,569
Cube493,327,159,722,610,495,550,371,805,988,708,253
Square root888,906.000000563≈irrational, shown to 9 decimal places
Cube root9,244.935632783≈
Negation-790,153,876,837
Reciprocal1.26557627 × 10^-12≈
Representations
Decimal790,153,876,837
Binary101101111111100011010111010101010110010140 bits
Octal13377065652545
HexadecimalB7F8D75565
Base 36A2ZP7TD1
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsseven hundred and ninety billion, one hundred and fifty-three million, eight hundred and seventy-six thousand, eight hundred and thirty-seven
Ordinalseven hundred and ninety billion, one hundred and fifty-three million, eight hundred and seventy-six thousand, eight hundred and thirty-seventh
Scientific notation7.90153877 × 10^11
Engineering notation790.153877 × 10^9
In other bases
Ternary2210112112011220212012101base 3; the most digit-efficient integer base after e: 25 digits
Quinary100421213343024322base 5; one hand: 18 digits
Septenary111041515064413base 7: 15 digits
Nonary2715464825171base 9; each digit is two ternary digits: 13 digits
Duodecimal109178b27031base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal1ah631ec1hbase 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal16:56:8:39:48:0:37base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10T11TT0TTT1TT0T10TT1TT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100000001001001010001010101010100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001011011111111000110101110101010101100101
Bit length40 bitsto write the magnitude
Set bits25the population count, or Hamming weight
Zero bits15within that length
Bit parityodd25 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes5b7 f8 d7 55 65
Gray code1110110000000100101111001111111111010111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001011011111111000110101110101010101100101
One's complement1111111111111111111111110100100000000111001010001010101010011010at 64 bits, every bit flipped
Bits reversed1010011010101010111010110001111111101101000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010110111111110001101011101010101011001010at 64 bits, wrapping
Shifted left by 110110111111110001101011101010101011001010= 1,580,307,753,674, no wrap
Shifted right by 1101101111111100011010111010101010110010= 395,076,938,418, discarding the low bit
These bits as a double3.90387885 × 10^-312≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
790,153,876,837 to the power 2624,343,149,080,540,965,124,569
790,153,876,837 to the power 3493,327,159,722,610,495,550,371,805,988,708,253
790,153,876,837 to the power 4389804367803806600585232020518… (48 digits)
790,153,876,837 to the power 5308005432428173648858591074062… (60 digits)
First ten multiples790,153,876,837, 1,580,307,753,674, 2,370,461,630,511, 3,160,615,507,348, 3,950,769,384,185, 4,740,923,261,022, 5,531,077,137,859, 6,321,231,014,696, 7,111,384,891,533, 7,901,538,768,370
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1262the total stopping time
Highest value reached2,370,461,630,5123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps790,153,876,837 → 2,370,461,630,512 → 1,185,230,815,256 → 592,615,407,628 → 296,307,703,814 → 148,153,851,907 → 444,461,555,722 → 222,230,777,861 → 666,692,333,584 → 333,346,166,792 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage79,015,387,683,700%
790,153,876,837% as a decimal7,901,538,768.37
790,153,876,837% of 100790,153,876,837
790,153,876,837% of 1,0007,901,538,768,370
As a fraction of 100790,153,876,837/100
Read another way
As seconds25,038 years, 170 days and 37 seconds
As bytes735.888 GiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 790,153,876,837
Nearby primes
Also reads as
790153876837 (identifier)
- 12 characters
- Checksum fails
790153876837 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). 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
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-12 (UPC-A)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
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