Base | Representation |
---|---|
bin | 100100101111101011110010… |
… | …1001111100111001101101100 |
3 | 1120101101212022002101122022112 |
4 | 1021133113211033213031230 |
5 | 314331010231110014012 |
6 | 3103230002255503152 |
7 | 125036240641063052 |
oct | 11137274517471554 |
9 | 1511355262348275 |
10 | 323213020001132 |
11 | 93a9296570aa48 |
12 | 30300a22527ab8 |
13 | 10b46b1aac03a1 |
14 | 59b5844d221d2 |
15 | 27577a4461122 |
hex | 125f5e53e736c |
323213020001132 has 48 divisors (see below), whose sum is σ = 574664993172480. Its totient is φ = 159048555772032.
The previous prime is 323213020001089. The next prime is 323213020001143. The reversal of 323213020001132 is 231100020312323.
It is a junction number, because it is equal to n+sod(n) for n = 323213020001098 and 323213020001107.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 29334248 + ... + 38819120.
It is an arithmetic number, because the mean of its divisors is an integer number (11972187357760).
Almost surely, 2323213020001132 is an apocalyptic number.
It is an amenable number.
323213020001132 is a deficient number, since it is larger than the sum of its proper divisors (251451973171348).
323213020001132 is a wasteful number, since it uses less digits than its factorization.
323213020001132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9485550 (or 9485548 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 323213020001132 its reverse (231100020312323), we get a palindrome (554313040313455).
The spelling of 323213020001132 in words is "three hundred twenty-three trillion, two hundred thirteen billion, twenty million, one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.135 sec. • engine limits •