Base | Representation |
---|---|
bin | 101111101001101011… |
… | …0110010001101101111 |
3 | 100210010120100102212110 |
4 | 1133103112302031233 |
5 | 3134033013310411 |
6 | 115002043335103 |
7 | 10251560314041 |
oct | 1372326621557 |
9 | 323116312773 |
10 | 102330213231 |
11 | 3a441812864 |
12 | 179ba221493 |
13 | 985a50293c |
14 | 4d4a715a91 |
15 | 29ddac82a6 |
hex | 17d35b236f |
102330213231 has 16 divisors (see below), whose sum is σ = 138720708864. Its totient is φ = 67089238464.
The previous prime is 102330213211. The next prime is 102330213233. The reversal of 102330213231 is 132312033201.
It is not a de Polignac number, because 102330213231 - 25 = 102330213199 is a prime.
It is a super-2 number, since 2×1023302132312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102330213198 and 102330213207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102330213233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1119475 + ... + 1207428.
It is an arithmetic number, because the mean of its divisors is an integer number (8670044304).
Almost surely, 2102330213231 is an apocalyptic number.
102330213231 is a deficient number, since it is larger than the sum of its proper divisors (36390495633).
102330213231 is a wasteful number, since it uses less digits than its factorization.
102330213231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2327150.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 102330213231 its reverse (132312033201), we get a palindrome (234642246432).
The spelling of 102330213231 in words is "one hundred two billion, three hundred thirty million, two hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •