Base | Representation |
---|---|
bin | 1110101001011100001011… |
… | …00010010111001100010011 |
3 | 11020001021011020011121021011 |
4 | 13110232011202113030103 |
5 | 13210212442213132243 |
6 | 152301054530311351 |
7 | 6533052533462455 |
oct | 724560542271423 |
9 | 136037136147234 |
10 | 32210200130323 |
11 | a2992a6289a06 |
12 | 3742676a28557 |
13 | 14c85412b1657 |
14 | 7d4da68982d5 |
15 | 3accdb96b89d |
hex | 1d4b85897313 |
32210200130323 has 4 divisors (see below), whose sum is σ = 32229225648928. Its totient is φ = 32191174611720.
The previous prime is 32210200130261. The next prime is 32210200130377. The reversal of 32210200130323 is 32303100201223.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32210200130323 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32210200130294 and 32210200130303.
It is not an unprimeable number, because it can be changed into a prime (32210200130023) 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, 9512756763 + ... + 9512760148.
It is an arithmetic number, because the mean of its divisors is an integer number (8057306412232).
Almost surely, 232210200130323 is an apocalyptic number.
32210200130323 is a deficient number, since it is larger than the sum of its proper divisors (19025518605).
32210200130323 is a wasteful number, since it uses less digits than its factorization.
32210200130323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19025518604.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 32210200130323 its reverse (32303100201223), we get a palindrome (64513300331546).
The spelling of 32210200130323 in words is "thirty-two trillion, two hundred ten billion, two hundred million, one hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •