Base | Representation |
---|---|
bin | 1001001101110000110001… |
… | …0011010100011010011011 |
3 | 1022212121112212221201011000 |
4 | 2103130030103110122123 |
5 | 2312000401231222303 |
6 | 33314331533040043 |
7 | 2064005153031036 |
oct | 223341423243233 |
9 | 38777485851130 |
10 | 10132034242203 |
11 | 3256a76208455 |
12 | 11777a5926023 |
13 | 5865a6606263 |
14 | 27057084801d |
15 | 12885667eda3 |
hex | 9370c4d469b |
10132034242203 has 16 divisors (see below), whose sum is σ = 15031592384800. Its totient is φ = 6745162416480.
The previous prime is 10132034242193. The next prime is 10132034242207. The reversal of 10132034242203 is 30224243023101.
10132034242203 is a `hidden beast` number, since 1 + 0 + 1 + 32 + 0 + 3 + 424 + 2 + 203 = 666.
It is not a de Polignac number, because 10132034242203 - 26 = 10132034242139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10132034242207) 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, 264621568 + ... + 264659853.
It is an arithmetic number, because the mean of its divisors is an integer number (939474524050).
Almost surely, 210132034242203 is an apocalyptic number.
10132034242203 is a deficient number, since it is larger than the sum of its proper divisors (4899558142597).
10132034242203 is an equidigital number, since it uses as much as digits as its factorization.
10132034242203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 529282139 (or 529282133 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 27.
Adding to 10132034242203 its reverse (30224243023101), we get a palindrome (40356277265304).
The spelling of 10132034242203 in words is "ten trillion, one hundred thirty-two billion, thirty-four million, two hundred forty-two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •