Base | Representation |
---|---|
bin | 110100010110000001000000… |
… | …000000110010000000001000 |
3 | 1010012002222122210002111210021 |
4 | 310112001000000302000020 |
5 | 220133240241134342412 |
6 | 2133341342035230224 |
7 | 66330135066666430 |
oct | 6426010000620010 |
9 | 1105088583074707 |
10 | 230211321012232 |
11 | 6739708912965a |
12 | 219a05b5748374 |
13 | 9b5bab02bb7b1 |
14 | 40bc4048452c0 |
15 | 1b934d113b607 |
hex | d16040032008 |
230211321012232 has 32 divisors (see below), whose sum is σ = 493521422644800. Its totient is φ = 98619704910144.
The previous prime is 230211321012223. The next prime is 230211321012247. The reversal of 230211321012232 is 232210123112032.
It is a junction number, because it is equal to n+sod(n) for n = 230211321012197 and 230211321012206.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 880905882 + ... + 881167177.
It is an arithmetic number, because the mean of its divisors is an integer number (15422544457650).
Almost surely, 2230211321012232 is an apocalyptic number.
It is an amenable number.
230211321012232 is an abundant number, since it is smaller than the sum of its proper divisors (263310101632568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230211321012232 is a wasteful number, since it uses less digits than its factorization.
230211321012232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1762075405 (or 1762075401 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 230211321012232 its reverse (232210123112032), we get a palindrome (462421444124264).
The spelling of 230211321012232 in words is "two hundred thirty trillion, two hundred eleven billion, three hundred twenty-one million, twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •