Base | Representation |
---|---|
bin | 100100101111101011110010… |
… | …0110101110010101000000011 |
3 | 1120101101212021121122201222210 |
4 | 1021133113210311302220003 |
5 | 314331010222341412011 |
6 | 3103230001454433203 |
7 | 125036240526411261 |
oct | 11137274465625003 |
9 | 1511355247581883 |
10 | 323213013232131 |
11 | 93a92961907330 |
12 | 30300a20202803 |
13 | 10b46b19590369 |
14 | 59b584407d431 |
15 | 27577a3a756a6 |
hex | 125f5e4d72a03 |
323213013232131 has 8 divisors (see below), whose sum is σ = 470128019246784. Its totient is φ = 195886674686120.
The previous prime is 323213013232049. The next prime is 323213013232163. The reversal of 323213013232131 is 131232310312323.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 323213013232131 - 211 = 323213013230083 is a prime.
It is a super-2 number, since 2×3232130132321312 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (323213013232931) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4897166867121 + ... + 4897166867186.
It is an arithmetic number, because the mean of its divisors is an integer number (58766002405848).
Almost surely, 2323213013232131 is an apocalyptic number.
323213013232131 is a deficient number, since it is larger than the sum of its proper divisors (146915006014653).
323213013232131 is a wasteful number, since it uses less digits than its factorization.
323213013232131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9794333734321.
The product of its (nonzero) digits is 11664, while the sum is 30.
Adding to 323213013232131 its reverse (131232310312323), we get a palindrome (454445323544454).
The spelling of 323213013232131 in words is "three hundred twenty-three trillion, two hundred thirteen billion, thirteen million, two hundred thirty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •