Base | Representation |
---|---|
bin | 1101011001100111000… |
… | …1101101010011000100 |
3 | 211000012221202211211112 |
4 | 3112121301231103010 |
5 | 12232434040230312 |
6 | 253431500024152 |
7 | 22426620003146 |
oct | 3263161552304 |
9 | 730187684745 |
10 | 230213211332 |
11 | 896a63a1045 |
12 | 38749b32058 |
13 | 1892a915a10 |
14 | b1dc98ac96 |
15 | 5ec5b66d22 |
hex | 3599c6d4c4 |
230213211332 has 24 divisors (see below), whose sum is σ = 435774674496. Its totient is φ = 105784174368.
The previous prime is 230213211329. The next prime is 230213211337. The reversal of 230213211332 is 233112312032.
230213211332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 230213211298 and 230213211307.
It is not an unprimeable number, because it can be changed into a prime (230213211337) 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 7 ways as a sum of consecutive naturals, for example, 9739688 + ... + 9763295.
It is an arithmetic number, because the mean of its divisors is an integer number (18157278104).
Almost surely, 2230213211332 is an apocalyptic number.
It is an amenable number.
230213211332 is a deficient number, since it is larger than the sum of its proper divisors (205561463164).
230213211332 is a wasteful number, since it uses less digits than its factorization.
230213211332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19503227 (or 19503225 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 230213211332 its reverse (233112312032), we get a palindrome (463325523364).
The spelling of 230213211332 in words is "two hundred thirty billion, two hundred thirteen million, two hundred eleven thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •