Base | Representation |
---|---|
bin | 110100110000001111001000… |
… | …111110001010100111001100 |
3 | 1010102111020122112022101112210 |
4 | 310300033020332022213030 |
5 | 220402301023241232340 |
6 | 2141241221452030420 |
7 | 66604254430360461 |
oct | 6460171076124714 |
9 | 1112436575271483 |
10 | 232013210102220 |
11 | 67a21282592538 |
12 | 2203186a762410 |
13 | 9c5c9a0a17711 |
14 | 41416dc07b668 |
15 | 1bc52e194a180 |
hex | d303c8f8a9cc |
232013210102220 has 48 divisors (see below), whose sum is σ = 667194744732768. Its totient is φ = 60198022080000.
The previous prime is 232013210102209. The next prime is 232013210102249. The reversal of 232013210102220 is 22201012310232.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 52255225281 + ... + 52255229720.
It is an arithmetic number, because the mean of its divisors is an integer number (13899890515266).
Almost surely, 2232013210102220 is an apocalyptic number.
232013210102220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
232013210102220 is an abundant number, since it is smaller than the sum of its proper divisors (435181534630548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232013210102220 is a wasteful number, since it uses less digits than its factorization.
232013210102220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104510455050 (or 104510455048 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 21.
Adding to 232013210102220 its reverse (22201012310232), we get a palindrome (254214222412452).
The spelling of 232013210102220 in words is "two hundred thirty-two trillion, thirteen billion, two hundred ten million, one hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •