Base | Representation |
---|---|
bin | 100100101111101011110111… |
… | …1111110010111100110011110 |
3 | 1120101101212202122011001122110 |
4 | 1021133113233332113212132 |
5 | 314331011113201430420 |
6 | 3103230032210254450 |
7 | 125036245255231635 |
oct | 11137275776274636 |
9 | 1511355678131573 |
10 | 323213200030110 |
11 | 93a92a482a2425 |
12 | 30300a72887426 |
13 | 10b46b491a4500 |
14 | 59b5860bc651c |
15 | 27577b5172ee0 |
hex | 125f5eff9799e |
323213200030110 has 96 divisors (see below), whose sum is σ = 840780275512320. Its totient is φ = 79483597225344.
The previous prime is 323213200030031. The next prime is 323213200030211. The reversal of 323213200030110 is 11030002312323.
It is a super-2 number, since 2×3232132000301102 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 25410874 + ... + 35946333.
It is an arithmetic number, because the mean of its divisors is an integer number (8758127869920).
Almost surely, 2323213200030110 is an apocalyptic number.
323213200030110 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
323213200030110 is an abundant number, since it is smaller than the sum of its proper divisors (517567075482210).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323213200030110 is a wasteful number, since it uses less digits than its factorization.
323213200030110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61358282 (or 61358269 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 323213200030110 its reverse (11030002312323), we get a palindrome (334243202342433).
The spelling of 323213200030110 in words is "three hundred twenty-three trillion, two hundred thirteen billion, two hundred million, thirty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •