Base | Representation |
---|---|
bin | 1001010001111010010111… |
… | …1000001110111110000101 |
3 | 1100010102120122002012211101 |
4 | 2110132211320032332011 |
5 | 2314132410024410041 |
6 | 33411202323140101 |
7 | 2102111015433052 |
oct | 224364570167605 |
9 | 40112518065741 |
10 | 10203330310021 |
11 | 3284231a61452 |
12 | 1189582814631 |
13 | 59022940cb34 |
14 | 273bb563a029 |
15 | 12a62a955b31 |
hex | 947a5e0ef85 |
10203330310021 has 8 divisors (see below), whose sum is σ = 10240769066400. Its totient is φ = 10165895896848.
The previous prime is 10203330310007. The next prime is 10203330310141. The reversal of 10203330310021 is 12001303330201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10203330310021 - 229 = 10202793439109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10203330311021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3659310 + ... + 5813536.
It is an arithmetic number, because the mean of its divisors is an integer number (1280096133300).
Almost surely, 210203330310021 is an apocalyptic number.
It is an amenable number.
10203330310021 is a deficient number, since it is larger than the sum of its proper divisors (37438756379).
10203330310021 is a wasteful number, since it uses less digits than its factorization.
10203330310021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2171603.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 10203330310021 its reverse (12001303330201), we get a palindrome (22204633640222).
The spelling of 10203330310021 in words is "ten trillion, two hundred three billion, three hundred thirty million, three hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.203 sec. • engine limits •