Base | Representation |
---|---|
bin | 100001111011000111000… |
… | …001010111110011000001 |
3 | 22020212021010100012100111 |
4 | 201323013001113303001 |
5 | 301143310043100113 |
6 | 4542535500351321 |
7 | 330265406050300 |
oct | 41730701276301 |
9 | 8225233305314 |
10 | 2331211300033 |
11 | 819730005820 |
12 | 317979b45541 |
13 | 13baa86a7a45 |
14 | 80b8cc6c437 |
15 | 409907d413d |
hex | 21ec7057cc1 |
2331211300033 has 12 divisors (see below), whose sum is σ = 2958346066032. Its totient is φ = 1816528285320.
The previous prime is 2331211299983. The next prime is 2331211300049. The reversal of 2331211300033 is 3300031121332.
It is not a de Polignac number, because 2331211300033 - 213 = 2331211291841 is a prime.
It is a super-2 number, since 2×23312113000332 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2331211299977 and 2331211300013.
It is not an unprimeable number, because it can be changed into a prime (2331211300073) 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, 2162533135 + ... + 2162534212.
It is an arithmetic number, because the mean of its divisors is an integer number (246528838836).
Almost surely, 22331211300033 is an apocalyptic number.
It is an amenable number.
2331211300033 is a deficient number, since it is larger than the sum of its proper divisors (627134765999).
2331211300033 is a wasteful number, since it uses less digits than its factorization.
2331211300033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4325067372 (or 4325067365 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 2331211300033 its reverse (3300031121332), we get a palindrome (5631242421365).
The spelling of 2331211300033 in words is "two trillion, three hundred thirty-one billion, two hundred eleven million, three hundred thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •