Base | Representation |
---|---|
bin | 100100101110001110010010… |
… | …0101001100010111101001100 |
3 | 1120100200200000000022222122121 |
4 | 1021130130210221202331030 |
5 | 314314213011344114012 |
6 | 3102553433201222324 |
7 | 125015601636562135 |
oct | 11134344451427514 |
9 | 1510620000288577 |
10 | 323012220301132 |
11 | 93a157934a335a |
12 | 30289b230319a4 |
13 | 10b30bc9bc4a5b |
14 | 59a9c36952c8c |
15 | 2752450bc3a07 |
hex | 125c724a62f4c |
323012220301132 has 48 divisors (see below), whose sum is σ = 595953903283200. Its totient is φ = 152996513532480.
The previous prime is 323012220301103. The next prime is 323012220301139. The reversal of 323012220301132 is 231103022210323.
It is a junction number, because it is equal to n+sod(n) for n = 323012220301097 and 323012220301106.
It is not an unprimeable number, because it can be changed into a prime (323012220301139) by changing a digit.
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, 142845082 + ... + 145088737.
It is an arithmetic number, because the mean of its divisors is an integer number (12415706318400).
Almost surely, 2323012220301132 is an apocalyptic number.
It is an amenable number.
323012220301132 is a deficient number, since it is larger than the sum of its proper divisors (272941682982068).
323012220301132 is a wasteful number, since it uses less digits than its factorization.
323012220301132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287934046 (or 287934044 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 323012220301132 its reverse (231103022210323), we get a palindrome (554115242511455).
The spelling of 323012220301132 in words is "three hundred twenty-three trillion, twelve billion, two hundred twenty million, three hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •