Base | Representation |
---|---|
bin | 1101100000101001011… |
… | …1010100111101011110 |
3 | 211012002121002102012100 |
4 | 3120022113110331132 |
5 | 12300321120340220 |
6 | 254343133545530 |
7 | 22524464323263 |
oct | 3301227247536 |
9 | 735077072170 |
10 | 232102121310 |
11 | 8a485662074 |
12 | 38b966452a6 |
13 | 18b6c065827 |
14 | b33b7a926a |
15 | 60868d3d90 |
hex | 360a5d4f5e |
232102121310 has 24 divisors (see below), whose sum is σ = 603465515640. Its totient is φ = 61893898992.
The previous prime is 232102121297. The next prime is 232102121311. The reversal of 232102121310 is 13121201232.
232102121310 is a `hidden beast` number, since 2 + 321 + 0 + 212 + 131 + 0 = 666.
It is a super-2 number, since 2×2321021213102 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232102121311) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1289456140 + ... + 1289456319.
It is an arithmetic number, because the mean of its divisors is an integer number (25144396485).
Almost surely, 2232102121310 is an apocalyptic number.
232102121310 is an abundant number, since it is smaller than the sum of its proper divisors (371363394330).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232102121310 is a wasteful number, since it uses less digits than its factorization.
232102121310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2578912472 (or 2578912469 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 232102121310 its reverse (13121201232), we get a palindrome (245223322542).
The spelling of 232102121310 in words is "two hundred thirty-two billion, one hundred two million, one hundred twenty-one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •