Base | Representation |
---|---|
bin | 100001101001001111001… |
… | …100111101000110101001 |
3 | 22012000201201210011210202 |
4 | 201221033030331012221 |
5 | 300340004411420241 |
6 | 4530043342121545 |
7 | 326016016645526 |
oct | 41511714750651 |
9 | 8160651704722 |
10 | 2312021201321 |
11 | 81158276a607 |
12 | 3141032802b5 |
13 | 13a03aa3b950 |
14 | 7dc8c36c14d |
15 | 4021abe8d9b |
hex | 21a4f33d1a9 |
2312021201321 has 16 divisors (see below), whose sum is σ = 2598967921536. Its totient is φ = 2040720312576.
The previous prime is 2312021201317. The next prime is 2312021201333. The reversal of 2312021201321 is 1231021202132.
2312021201321 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 2312021201321 - 22 = 2312021201317 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2312021201293 and 2312021201302.
It is not an unprimeable number, because it can be changed into a prime (2312021201351) 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, 332240 + ... + 2175873.
It is an arithmetic number, because the mean of its divisors is an integer number (162435495096).
Almost surely, 22312021201321 is an apocalyptic number.
It is an amenable number.
2312021201321 is a deficient number, since it is larger than the sum of its proper divisors (286946720215).
2312021201321 is a wasteful number, since it uses less digits than its factorization.
2312021201321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2511232.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 2312021201321 its reverse (1231021202132), we get a palindrome (3543042403453).
The spelling of 2312021201321 in words is "two trillion, three hundred twelve billion, twenty-one million, two hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •