Base | Representation |
---|---|
bin | 10000110000111111110… |
… | …101000101001111001111 |
3 | 11002010211101000112220022 |
4 | 100300333311011033033 |
5 | 122334021230140043 |
6 | 2241135543212355 |
7 | 146144442252365 |
oct | 20607765051717 |
9 | 4063741015808 |
10 | 1152122115023 |
11 | 404680997510 |
12 | 1673574470bb |
13 | 8484c3a9b59 |
14 | 3da9799d635 |
15 | 1ee817ca868 |
hex | 10c3fd453cf |
1152122115023 has 16 divisors (see below), whose sum is σ = 1331122844160. Its totient is φ = 985528944000.
The previous prime is 1152122115019. The next prime is 1152122115041. The reversal of 1152122115023 is 3205112212511.
It is a cyclic number.
It is not a de Polignac number, because 1152122115023 - 22 = 1152122115019 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1152122114983 and 1152122115001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1152122115013) 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 15 ways as a sum of consecutive naturals, for example, 2903 + ... + 1517976.
It is an arithmetic number, because the mean of its divisors is an integer number (83195177760).
Almost surely, 21152122115023 is an apocalyptic number.
1152122115023 is a deficient number, since it is larger than the sum of its proper divisors (179000729137).
1152122115023 is a wasteful number, since it uses less digits than its factorization.
1152122115023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1524958.
The product of its (nonzero) digits is 1200, while the sum is 26.
Adding to 1152122115023 its reverse (3205112212511), we get a palindrome (4357234327534).
The spelling of 1152122115023 in words is "one trillion, one hundred fifty-two billion, one hundred twenty-two million, one hundred fifteen thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •