Base | Representation |
---|---|
bin | 11111011111010000000… |
… | …00111111001010110101 |
3 | 10211102122111222100112110 |
4 | 33233220000333022311 |
5 | 120211242404123044 |
6 | 2145010445041233 |
7 | 141111134600004 |
oct | 17575000771265 |
9 | 3742574870473 |
10 | 1081929364149 |
11 | 387930a138a7 |
12 | 155827b56219 |
13 | 7b04404593a |
14 | 3a519530c3b |
15 | 1d2242e36b9 |
hex | fbe803f2b5 |
1081929364149 has 8 divisors (see below), whose sum is σ = 1451210644800. Its totient is φ = 716967163136.
The previous prime is 1081929364127. The next prime is 1081929364163. The reversal of 1081929364149 is 9414639291801.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1081929364149 - 216 = 1081929298613 is a prime.
It is a super-2 number, since 2×10819293641492 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1081929364189) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1079769324 + ... + 1079770325.
It is an arithmetic number, because the mean of its divisors is an integer number (181401330600).
Almost surely, 21081929364149 is an apocalyptic number.
It is an amenable number.
1081929364149 is a deficient number, since it is larger than the sum of its proper divisors (369281280651).
1081929364149 is a wasteful number, since it uses less digits than its factorization.
1081929364149 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2159539819.
The product of its (nonzero) digits is 3359232, while the sum is 57.
The spelling of 1081929364149 in words is "one trillion, eighty-one billion, nine hundred twenty-nine million, three hundred sixty-four thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •