Base | Representation |
---|---|
bin | 1001001101110001000011… |
… | …0101000101010101011011 |
3 | 1022212121202011212212200100 |
4 | 2103130100311011111123 |
5 | 2312001030202432303 |
6 | 33314343245110443 |
7 | 2064010064466543 |
oct | 223342065052533 |
9 | 38777664785610 |
10 | 10132110202203 |
11 | 325700507a310 |
12 | 1177807258423 |
13 | 5865b92807c2 |
14 | 27057a97c323 |
15 | 12885d1868a3 |
hex | 93710d4555b |
10132110202203 has 12 divisors (see below), whose sum is σ = 15965749409688. Its totient is φ = 6140672849760.
The previous prime is 10132110202169. The next prime is 10132110202223. The reversal of 10132110202203 is 30220201123101.
10132110202203 is a `hidden beast` number, since 101 + 321 + 1 + 0 + 20 + 220 + 3 = 666.
It is not a de Polignac number, because 10132110202203 - 26 = 10132110202139 is a prime.
It is a super-2 number, since 2×101321102022032 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10132110202223) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 51172273650 + ... + 51172273847.
It is an arithmetic number, because the mean of its divisors is an integer number (1330479117474).
Almost surely, 210132110202203 is an apocalyptic number.
10132110202203 is a deficient number, since it is larger than the sum of its proper divisors (5833639207485).
10132110202203 is a wasteful number, since it uses less digits than its factorization.
10132110202203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102344547514 (or 102344547511 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10132110202203 its reverse (30220201123101), we get a palindrome (40352311325304).
The spelling of 10132110202203 in words is "ten trillion, one hundred thirty-two billion, one hundred ten million, two hundred two thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •