Base | Representation |
---|---|
bin | 100001110011100101010… |
… | …110110110101000010000 |
3 | 22020002101221112112110001 |
4 | 201303211112312220100 |
5 | 301030232330010412 |
6 | 4535121545015344 |
7 | 326561222564101 |
oct | 41634526665020 |
9 | 8202357475401 |
10 | 2323130313232 |
11 | 816263552833 |
12 | 3162a3784554 |
13 | 13b0bb44a351 |
14 | 806239223a8 |
15 | 4066b13c957 |
hex | 21ce55b6a10 |
2323130313232 has 20 divisors (see below), whose sum is σ = 4503209432400. Its totient is φ = 1161011750048.
The previous prime is 2323130313223. The next prime is 2323130313241.
2323130313232 is nontrivially palindromic in base 10.
It is an interprime number because it is at equal distance from previous prime (2323130313223) and next prime (2323130313241).
It is a self number, because there is not a number n which added to its sum of digits gives 2323130313232.
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, 34553278 + ... + 34620445.
It is an arithmetic number, because the mean of its divisors is an integer number (225160471620).
Almost surely, 22323130313232 is an apocalyptic number.
It is an amenable number.
2323130313232 is a deficient number, since it is larger than the sum of its proper divisors (2180079119168).
2323130313232 is a wasteful number, since it uses less digits than its factorization.
2323130313232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69175830 (or 69175824 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 28.
It can be divided in two parts, 2323130 and 313232, that added together give a palindrome (2636362).
The spelling of 2323130313232 in words is "two trillion, three hundred twenty-three billion, one hundred thirty million, three hundred thirteen thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •