Base | Representation |
---|---|
bin | 110110001010101001… |
… | …0000000000000000001 |
3 | 102010020121210000210111 |
4 | 1230111102000000001 |
5 | 3401211204011441 |
6 | 125234234031321 |
7 | 11255355343651 |
oct | 1542522000001 |
9 | 363217700714 |
10 | 116321157121 |
11 | 45371296004 |
12 | 1a663878541 |
13 | ac79c90770 |
14 | 58b6912361 |
15 | 305c01d081 |
hex | 1b15480001 |
116321157121 has 32 divisors (see below), whose sum is σ = 130600042496. Its totient is φ = 102876480000.
The previous prime is 116321157067. The next prime is 116321157133. The reversal of 116321157121 is 121751123611.
It is a happy number.
It is a 8-Lehmer number, since φ(116321157121) divides (116321157121-1)8.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-116321157121 is a prime.
It is a super-2 number, since 2×1163211571212 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (116321167121) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27686821 + ... + 27691021.
It is an arithmetic number, because the mean of its divisors is an integer number (4081251328).
It is a Proth number, since it is equal to 221865 ⋅ 219 + 1 and 221865 < 219.
Almost surely, 2116321157121 is an apocalyptic number.
It is an amenable number.
116321157121 is a deficient number, since it is larger than the sum of its proper divisors (14278885375).
116321157121 is a wasteful number, since it uses less digits than its factorization.
116321157121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4913.
The product of its digits is 2520, while the sum is 31.
The spelling of 116321157121 in words is "one hundred sixteen billion, three hundred twenty-one million, one hundred fifty-seven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •