Base | Representation |
---|---|
bin | 1010100100000101011101… |
… | …10101111100010101101011 |
3 | 10001020202222202112211221112 |
4 | 11102002232311330111223 |
5 | 11021100234311410011 |
6 | 121223433533100535 |
7 | 4615214641251203 |
oct | 522025665742553 |
9 | 101222882484845 |
10 | 23230116513131 |
11 | 7446923188a90 |
12 | 273219b02774b |
13 | cc678a6a0978 |
14 | 5a44b4d2d403 |
15 | 2a44069e058b |
hex | 1520aed7c56b |
23230116513131 has 8 divisors (see below), whose sum is σ = 25541488164864. Its totient is φ = 20952002007720.
The previous prime is 23230116513061. The next prime is 23230116513179. The reversal of 23230116513131 is 13131561103232.
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 23230116513131 - 210 = 23230116512107 is a prime.
It is a super-2 number, since 2×232301165131312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (23230116413131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8314285115 + ... + 8314287908.
It is an arithmetic number, because the mean of its divisors is an integer number (3192686020608).
Almost surely, 223230116513131 is an apocalyptic number.
23230116513131 is a deficient number, since it is larger than the sum of its proper divisors (2311371651733).
23230116513131 is a wasteful number, since it uses less digits than its factorization.
23230116513131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16628573161.
The product of its (nonzero) digits is 9720, while the sum is 32.
Adding to 23230116513131 its reverse (13131561103232), we get a palindrome (36361677616363).
The spelling of 23230116513131 in words is "twenty-three trillion, two hundred thirty billion, one hundred sixteen million, five hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •