Base | Representation |
---|---|
bin | 1010011110101001100010… |
… | …00101110000000001001111 |
3 | 10000120220211210212000111112 |
4 | 11033110301011300001033 |
5 | 11010020211210242111 |
6 | 121001542334442235 |
7 | 4565553012603134 |
oct | 517246105600117 |
9 | 100526753760445 |
10 | 23043323134031 |
11 | 7384689197612 |
12 | 2701b4a36337b |
13 | cb1c8c4b8295 |
14 | 599434c0058b |
15 | 29e622bd3e8b |
hex | 14f53117004f |
23043323134031 has 8 divisors (see below), whose sum is σ = 23311783281600. Its totient is φ = 22775075128960.
The previous prime is 23043323133931. The next prime is 23043323134037. The reversal of 23043323134031 is 13043132334032.
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 23043323134031 - 222 = 23043318939727 is a prime.
It is a super-2 number, since 2×230433231340312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23043323134037) 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, 52817111 + ... + 53251608.
It is an arithmetic number, because the mean of its divisors is an integer number (2913972910200).
Almost surely, 223043323134031 is an apocalyptic number.
23043323134031 is a deficient number, since it is larger than the sum of its proper divisors (268460147569).
23043323134031 is a wasteful number, since it uses less digits than its factorization.
23043323134031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106071249.
The product of its (nonzero) digits is 46656, while the sum is 32.
Adding to 23043323134031 its reverse (13043132334032), we get a palindrome (36086455468063).
The spelling of 23043323134031 in words is "twenty-three trillion, forty-three billion, three hundred twenty-three million, one hundred thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •