Recognised as Number
790,153,876,836
- Positive
- Even
- Composite
- Perfect square
- 12 digits
790,153,876,836 is an even 12-digit integer and a composite number. It has 27 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value790,153,876,836
Digit count12
Digit sum63
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
Perfect squareYes, 888,906²
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^2 × 3^2 × 148,151^2
Distinct prime factors32, 3, 148,151
Number of divisors27
Sum of divisors σ(n)1,997,346,892,723
Aliquot sum1,207,193,015,887sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)263,382,847,800integers below n that share no factor with it
Carmichael function λ(n)65,845,711,950the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 263,382,847,800
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 9, 12, 18, 36, 148,151, 296,302, 444,453, 592,604, 888,906, 1,333,359, 1,777,812, 2,666,718, 5,333,436, 21,948,718,801, 43,897,437,602, 65,846,156,403, 87,794,875,204, 131,692,312,806, 197,538,469,209, 263,384,625,612, 395,076,938,418, 790,153,876,83627 in total
Arithmetic
Previous number790,153,876,835
Next number790,153,876,837
Double1,580,307,753,672
Half395,076,938,418
Square624,343,149,078,960,657,370,896
Cube493,327,159,720,737,466,103,132,553,554,965,056
Square root888,906exact
Cube root9,244.935632779≈
Negation-790,153,876,836
Reciprocal1.26557627 × 10^-12≈
Representations
Decimal790,153,876,836
Binary101101111111100011010111010101010110010040 bits
Octal13377065652544
HexadecimalB7F8D75564
Base 36A2ZP7TD0
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-six
Ordinalseven hundred and ninety billion, one hundred and fifty-three million, eight hundred and seventy-six thousand, eight hundred and thirty-sixth
Scientific notation7.90153877 × 10^11
Engineering notation790.153877 × 10^9
In other bases
Ternary2210112112011220212012100base 3; the most digit-efficient integer base after e: 25 digits
Quinary100421213343024321base 5; one hand: 18 digits
Septenary111041515064412base 7: 15 digits
Nonary2715464825170base 9; each digit is two ternary digits: 13 digits
Duodecimal109178b27030base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 12 digits
Vigesimal1ah631ec1gbase 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal16:56:8:39:48:0:36base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternary10T11TT0TTT1TT0T10TT1TT100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100000001001001010001010101010100100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000000001011011111111000110101110101010101100100
Bit length40 bitsto write the magnitude
Set bits24the population count, or Hamming weight
Zero bits16within that length
Bit parityeven24 set bits, so even; not the same as the number itself being even
Highest set bitbit 39worth 549,755,813,888
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes5b7 f8 d7 55 64
Gray code1110110000000100101111001111111111010110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000000001011011111111000110101110101010101100100
One's complement1111111111111111111111110100100000000111001010001010101010011011at 64 bits, every bit flipped
Bits reversed0010011010101010111010110001111111101101000000000000000000000000at 64 bits
Rotated left by 10000000000000000000000010110111111110001101011101010101011001000at 64 bits, wrapping
Shifted left by 110110111111110001101011101010101011001000= 1,580,307,753,672, 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,836 to the power 2624,343,149,078,960,657,370,896
790,153,876,836 to the power 3493,327,159,720,737,466,103,132,553,554,965,056
790,153,876,836 to the power 4389804367801833291946345324595… (48 digits)
790,153,876,836 to the power 5308005432426224627019576974330… (60 digits)
First ten multiples790,153,876,836, 1,580,307,753,672, 2,370,461,630,508, 3,160,615,507,344, 3,950,769,384,180, 4,740,923,261,016, 5,531,077,137,852, 6,321,231,014,688, 7,111,384,891,524, 7,901,538,768,360
Powers of twoBetween 2^39 (549,755,813,888) and 2^40 (1,099,511,627,776)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 4
Divisible by 9Yes
Divisible by 10No, remainder 6
Divisible by 11No, remainder 5
Divisible by 12Yes
Divisible by 100No, remainder 36
Collatz (3n + 1) trajectory
Steps to reach 1262the total stopping time
Highest value reached790,153,876,836
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps790,153,876,836 → 395,076,938,418 → 197,538,469,209 → 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,600%
790,153,876,836% as a decimal7,901,538,768.36
790,153,876,836% of 100790,153,876,836
790,153,876,836% of 1,0007,901,538,768,360
As a fraction of 100790,153,876,836/100
Read another way
As seconds25,038 years, 170 days and 36 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,836
Nearby primes
Also reads as
790153876836 (identifier)
- 12 characters
- Checksum fails
790153876836 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