Base | Representation |
---|---|
bin | 110100010100011011010010… |
… | …000111111100010010011101 |
3 | 1010011201112202012112110102220 |
4 | 310110123102013330102131 |
5 | 220124443101410310323 |
6 | 2133215240310535553 |
7 | 66316220424011340 |
oct | 6424332207742235 |
9 | 1104645665473386 |
10 | 230102103213213 |
11 | 67354832572740 |
12 | 219833b49675b9 |
13 | 9b516c5b8210a |
14 | 40b70034b6457 |
15 | 1b9073ca520e3 |
hex | d146d21fc49d |
230102103213213 has 32 divisors (see below), whose sum is σ = 383344389012480. Its totient is φ = 119271998655360.
The previous prime is 230102103213193. The next prime is 230102103213247. The reversal of 230102103213213 is 312312301201032.
230102103213213 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 230102103213213 - 236 = 230033383736477 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (230102103213413) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1089733603 + ... + 1089944736.
It is an arithmetic number, because the mean of its divisors is an integer number (11979512156640).
Almost surely, 2230102103213213 is an apocalyptic number.
It is an amenable number.
230102103213213 is a deficient number, since it is larger than the sum of its proper divisors (153242285799267).
230102103213213 is a wasteful number, since it uses less digits than its factorization.
230102103213213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2179678817.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 230102103213213 its reverse (312312301201032), we get a palindrome (542414404414245).
The spelling of 230102103213213 in words is "two hundred thirty trillion, one hundred two billion, one hundred three million, two hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •