Base | Representation |
---|---|
bin | 100100101111101011110010… |
… | …1110110010000000110110100 |
3 | 1120101101212022210110020122111 |
4 | 1021133113211312100012310 |
5 | 314331010241203130400 |
6 | 3103230003300540404 |
7 | 125036241123140425 |
oct | 11137274566200664 |
9 | 1511355283406574 |
10 | 323213030130100 |
11 | 93a929703a8aa0 |
12 | 30300a259b1704 |
13 | 10b46b1cc28866 |
14 | 59b58463db64c |
15 | 27577a52b23ba |
hex | 125f5e5d901b4 |
323213030130100 has 36 divisors (see below), whose sum is σ = 765133391328768. Its totient is φ = 117532010956000.
The previous prime is 323213030130037. The next prime is 323213030130101. The reversal of 323213030130100 is 1031030312323.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323213030130101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 146915012596 + ... + 146915014795.
It is an arithmetic number, because the mean of its divisors is an integer number (21253705314688).
Almost surely, 2323213030130100 is an apocalyptic number.
It is an amenable number.
323213030130100 is an abundant number, since it is smaller than the sum of its proper divisors (441920361198668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323213030130100 is a wasteful number, since it uses less digits than its factorization.
323213030130100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 293830027416 (or 293830027409 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 323213030130100 its reverse (1031030312323), we get a palindrome (324244060442423).
The spelling of 323213030130100 in words is "three hundred twenty-three trillion, two hundred thirteen billion, thirty million, one hundred thirty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •