Base | Representation |
---|---|
bin | 100100101111110011110011… |
… | …0100100111010100111001101 |
3 | 1120101110111200221102111211210 |
4 | 1021133213212210322213031 |
5 | 314331300443342411023 |
6 | 3103241525243205033 |
7 | 125040420141452505 |
oct | 11137474644724715 |
9 | 1511414627374753 |
10 | 323230222232013 |
11 | 93a9a192945688 |
12 | 30304223516779 |
13 | 10b4862c96c325 |
14 | 59b65d7804a05 |
15 | 2757e5e783593 |
hex | 125f9e693a9cd |
323230222232013 has 16 divisors (see below), whose sum is σ = 464218439786496. Its totient is φ = 199468860843120.
The previous prime is 323230222231999. The next prime is 323230222232041. The reversal of 323230222232013 is 310232222032323.
It is not a de Polignac number, because 323230222232013 - 26 = 323230222231949 is a prime.
It is a super-2 number, since 2×3232302222320132 (a number of 30 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323230222232053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 75556384545 + ... + 75556388822.
It is an arithmetic number, because the mean of its divisors is an integer number (29013652486656).
Almost surely, 2323230222232013 is an apocalyptic number.
It is an amenable number.
323230222232013 is a deficient number, since it is larger than the sum of its proper divisors (140988217554483).
323230222232013 is a wasteful number, since it uses less digits than its factorization.
323230222232013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151112773424.
The product of its (nonzero) digits is 31104, while the sum is 30.
Adding to 323230222232013 its reverse (310232222032323), we get a palindrome (633462444264336).
The spelling of 323230222232013 in words is "three hundred twenty-three trillion, two hundred thirty billion, two hundred twenty-two million, two hundred thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •