Base | Representation |
---|---|
bin | 1001010001110101011111… |
… | …0110000111000001010011 |
3 | 1100010022012101121222220102 |
4 | 2110131113312013001103 |
5 | 2314122214402132243 |
6 | 33410424355003015 |
7 | 2102033410540451 |
oct | 224352766070123 |
9 | 40108171558812 |
10 | 10202021130323 |
11 | 328371aa64360 |
12 | 118927829946b |
13 | 59007b10c7a9 |
14 | 273acd8099d1 |
15 | 12a5a0a509b8 |
hex | 94757d87053 |
10202021130323 has 32 divisors (see below), whose sum is σ = 12308651177472. Its totient is φ = 8341234316800.
The previous prime is 10202021130311. The next prime is 10202021130419. The reversal of 10202021130323 is 32303112020201.
10202021130323 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 10202021130323 - 226 = 10201954021459 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10202021130295 and 10202021130304.
It is not an unprimeable number, because it can be changed into a prime (10202921130323) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3186128 + ... + 5527698.
It is an arithmetic number, because the mean of its divisors is an integer number (384645349296).
Almost surely, 210202021130323 is an apocalyptic number.
10202021130323 is a deficient number, since it is larger than the sum of its proper divisors (2106630047149).
10202021130323 is a wasteful number, since it uses less digits than its factorization.
10202021130323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2342635.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 10202021130323 its reverse (32303112020201), we get a palindrome (42505133150524).
The spelling of 10202021130323 in words is "ten trillion, two hundred two billion, twenty-one million, one hundred thirty thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •