Base | Representation |
---|---|
bin | 100100101111100110101101… |
… | …0011111100000011101000010 |
3 | 1120101100211010012121212220110 |
4 | 1021133031122133200131002 |
5 | 314330320401130401010 |
6 | 3103220555045252150 |
7 | 125035403250232326 |
oct | 11137153237403502 |
9 | 1511324105555813 |
10 | 323202102200130 |
11 | 93a8927291550a |
12 | 302ba896104056 |
13 | 10b45a9ac15cca |
14 | 59b50cad2b986 |
15 | 2757365c0c120 |
hex | 125f35a7e0742 |
323202102200130 has 32 divisors (see below), whose sum is σ = 776254982957568. Its totient is φ = 86123900844800.
The previous prime is 323202102200101. The next prime is 323202102200147. The reversal of 323202102200130 is 31002201202323.
It is a happy number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 323202102200097 and 323202102200106.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3957859026 + ... + 3957940685.
It is an arithmetic number, because the mean of its divisors is an integer number (24257968217424).
Almost surely, 2323202102200130 is an apocalyptic number.
323202102200130 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
323202102200130 is an abundant number, since it is smaller than the sum of its proper divisors (453052880757438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
323202102200130 is a wasteful number, since it uses less digits than its factorization.
323202102200130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7915801082.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 323202102200130 its reverse (31002201202323), we get a palindrome (354204303402453).
The spelling of 323202102200130 in words is "three hundred twenty-three trillion, two hundred two billion, one hundred two million, two hundred thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •