Base | Representation |
---|---|
bin | 1110100111000111100101… |
… | …11011101111001010010111 |
3 | 11012202122020222201000120021 |
4 | 13103203302323233022113 |
5 | 13202411110331320043 |
6 | 152200303303450011 |
7 | 6524230015205305 |
oct | 723436273571227 |
9 | 135678228630507 |
10 | 32130431120023 |
11 | a268491801905 |
12 | 372b114456907 |
13 | 14c0b6ac94442 |
14 | 7d119a68b275 |
15 | 3aabbd8c93ed |
hex | 1d38f2eef297 |
32130431120023 has 4 divisors (see below), whose sum is σ = 32130457026640. Its totient is φ = 32130405213408.
The previous prime is 32130431119951. The next prime is 32130431120129. The reversal of 32130431120023 is 32002113403123.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 32130431120023 - 229 = 32129894249111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 32130431120023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32130431220023) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10994178 + ... + 13606351.
It is an arithmetic number, because the mean of its divisors is an integer number (8032614256660).
Almost surely, 232130431120023 is an apocalyptic number.
32130431120023 is a deficient number, since it is larger than the sum of its proper divisors (25906617).
32130431120023 is a wasteful number, since it uses less digits than its factorization.
32130431120023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25906616.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 32130431120023 its reverse (32002113403123), we get a palindrome (64132544523146).
The spelling of 32130431120023 in words is "thirty-two trillion, one hundred thirty billion, four hundred thirty-one million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •