Base | Representation |
---|---|
bin | 1001011010001111000… |
… | …11011100011110101111 |
3 | 1010220112221022021011021 |
4 | 10231013203130132233 |
5 | 20244131143134411 |
6 | 404311010235011 |
7 | 32234150222650 |
oct | 4550743343657 |
9 | 1126487267137 |
10 | 323323021231 |
11 | 115136464361 |
12 | 527b4285a67 |
13 | 24648ab91a2 |
14 | 119128b7527 |
15 | 8625028a71 |
hex | 4b478dc7af |
323323021231 has 32 divisors (see below), whose sum is σ = 374984064000. Its totient is φ = 273058532352.
The previous prime is 323323021201. The next prime is 323323021303. The reversal of 323323021231 is 132120323323.
It is not a de Polignac number, because 323323021231 - 29 = 323323020719 is a prime.
It is a super-2 number, since 2×3233230212312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 323323021196 and 323323021205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323323021201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 221605180 + ... + 221606638.
It is an arithmetic number, because the mean of its divisors is an integer number (11718252000).
Almost surely, 2323323021231 is an apocalyptic number.
323323021231 is a deficient number, since it is larger than the sum of its proper divisors (51661042769).
323323021231 is a wasteful number, since it uses less digits than its factorization.
323323021231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2791.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 323323021231 its reverse (132120323323), we get a palindrome (455443344554).
The spelling of 323323021231 in words is "three hundred twenty-three billion, three hundred twenty-three million, twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •