Base | Representation |
---|---|
bin | 110100110000001111000010… |
… | …100110000100001001111101 |
3 | 1010102111020101002000011221011 |
4 | 310300033002212010021331 |
5 | 220402300313344333041 |
6 | 2141241203111035221 |
7 | 66604251661141105 |
oct | 6460170246041175 |
9 | 1112436332004834 |
10 | 232013103121021 |
11 | 67a21228162a22 |
12 | 2203183a96bb11 |
13 | 9c5c9847cb431 |
14 | 41416cbb90205 |
15 | 1bc52d7366e81 |
hex | d303c298427d |
232013103121021 has 16 divisors (see below), whose sum is σ = 233201487456000. Its totient is φ = 230827977768960.
The previous prime is 232013103120989. The next prime is 232013103121039. The reversal of 232013103121021 is 120121301310232.
It is a cyclic number.
It is not a de Polignac number, because 232013103121021 - 25 = 232013103120989 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232013103120983 and 232013103121001.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232013103121091) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 639408381 + ... + 639771133.
It is an arithmetic number, because the mean of its divisors is an integer number (14575092966000).
Almost surely, 2232013103121021 is an apocalyptic number.
It is an amenable number.
232013103121021 is a deficient number, since it is larger than the sum of its proper divisors (1188384334979).
232013103121021 is a wasteful number, since it uses less digits than its factorization.
232013103121021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 367236.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 232013103121021 its reverse (120121301310232), we get a palindrome (352134404431253).
The spelling of 232013103121021 in words is "two hundred thirty-two trillion, thirteen billion, one hundred three million, one hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •