Base | Representation |
---|---|
bin | 1001010001111001001101… |
… | …1101100010011100011010 |
3 | 1100010101210002122222221222 |
4 | 2110132103131202130122 |
5 | 2314131241424301020 |
6 | 33411111524332042 |
7 | 2102100244200266 |
oct | 224362335423432 |
9 | 40111702588858 |
10 | 10203021322010 |
11 | 32840935a9160 |
12 | 11894b7244022 |
13 | 5901aa3b5caa |
14 | 273b865a70a6 |
15 | 12a60d76db25 |
hex | 9479376271a |
10203021322010 has 64 divisors (see below), whose sum is σ = 20314927713024. Its totient is φ = 3658382784000.
The previous prime is 10203021321947. The next prime is 10203021322037. The reversal of 10203021322010 is 1022312030201.
10203021322010 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×102030213220102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10203021322010.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30080360 + ... + 30417660.
It is an arithmetic number, because the mean of its divisors is an integer number (317420745516).
Almost surely, 210203021322010 is an apocalyptic number.
10203021322010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10203021322010 is a deficient number, since it is larger than the sum of its proper divisors (10111906391014).
10203021322010 is a wasteful number, since it uses less digits than its factorization.
10203021322010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 341159.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10203021322010 its reverse (1022312030201), we get a palindrome (11225333352211).
The spelling of 10203021322010 in words is "ten trillion, two hundred three billion, twenty-one million, three hundred twenty-two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •