Base | Representation |
---|---|
bin | 1101100000101101110… |
… | …0010101011101101000 |
3 | 211012010212010111000010 |
4 | 3120023130111131220 |
5 | 12300340233230204 |
6 | 254345021411520 |
7 | 22525104145632 |
oct | 3301334253550 |
9 | 735125114003 |
10 | 232120211304 |
11 | 8a494898383 |
12 | 38ba0709ba0 |
13 | 18b72a2a777 |
14 | b33dd57a52 |
15 | 60882a8d89 |
hex | 360b715768 |
232120211304 has 16 divisors (see below), whose sum is σ = 580300528320. Its totient is φ = 77373403760.
The previous prime is 232120211299. The next prime is 232120211341. The reversal of 232120211304 is 403112021232.
232120211304 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 4835837712 + ... + 4835837759.
It is an arithmetic number, because the mean of its divisors is an integer number (36268783020).
Almost surely, 2232120211304 is an apocalyptic number.
232120211304 is a gapful number since it is divisible by the number (24) formed by its first and last digit.
It is an amenable number.
232120211304 is an abundant number, since it is smaller than the sum of its proper divisors (348180317016).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232120211304 is a wasteful number, since it uses less digits than its factorization.
232120211304 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9671675480 (or 9671675476 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 232120211304 its reverse (403112021232), we get a palindrome (635232232536).
The spelling of 232120211304 in words is "two hundred thirty-two billion, one hundred twenty million, two hundred eleven thousand, three hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •