Base | Representation |
---|---|
bin | 1001011010011010101… |
… | …10010011100100000101 |
3 | 1010220210201020111102100 |
4 | 10231031112103210011 |
5 | 20244331040141013 |
6 | 404324402102313 |
7 | 32236440452664 |
oct | 4551526234405 |
9 | 1126721214370 |
10 | 323420240133 |
11 | 115186326361 |
12 | 5282094a999 |
13 | 24662c97b73 |
14 | 11921782ddb |
15 | 862d82e473 |
hex | 4b4d593905 |
323420240133 has 12 divisors (see below), whose sum is σ = 487473985440. Its totient is φ = 206238993576.
The previous prime is 323420240131. The next prime is 323420240159. The reversal of 323420240133 is 331042024323.
323420240133 is a `hidden beast` number, since 3 + 23 + 4 + 202 + 401 + 33 = 666.
It is not a de Polignac number, because 323420240133 - 21 = 323420240131 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 323420240097 and 323420240106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (323420240131) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 781208103 + ... + 781208516.
It is an arithmetic number, because the mean of its divisors is an integer number (40622832120).
Almost surely, 2323420240133 is an apocalyptic number.
It is an amenable number.
323420240133 is a deficient number, since it is larger than the sum of its proper divisors (164053745307).
323420240133 is a wasteful number, since it uses less digits than its factorization.
323420240133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1562416648 (or 1562416645 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 27.
Adding to 323420240133 its reverse (331042024323), we get a palindrome (654462264456).
The spelling of 323420240133 in words is "three hundred twenty-three billion, four hundred twenty million, two hundred forty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •