Base | Representation |
---|---|
bin | 1101100000101001110… |
… | …0001111110101000101 |
3 | 211012002200111221100010 |
4 | 3120022130033311011 |
5 | 12300321433123023 |
6 | 254343221340433 |
7 | 22524511304325 |
oct | 3301234176505 |
9 | 735080457303 |
10 | 232103411013 |
11 | 8a486363041 |
12 | 38b96b67719 |
13 | 18b6c3c7876 |
14 | b33ba23285 |
15 | 6086a8b093 |
hex | 360a70fd45 |
232103411013 has 32 divisors (see below), whose sum is σ = 325876890240. Its totient is φ = 146740930560.
The previous prime is 232103410969. The next prime is 232103411027. The reversal of 232103411013 is 310114301232.
232103411013 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 232103411013 - 28 = 232103410757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232103411053) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1454770 + ... + 1606412.
It is an arithmetic number, because the mean of its divisors is an integer number (10183652820).
Almost surely, 2232103411013 is an apocalyptic number.
It is an amenable number.
232103411013 is a deficient number, since it is larger than the sum of its proper divisors (93773479227).
232103411013 is a wasteful number, since it uses less digits than its factorization.
232103411013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151989.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 232103411013 its reverse (310114301232), we get a palindrome (542217712245).
The spelling of 232103411013 in words is "two hundred thirty-two billion, one hundred three million, four hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •