Base | Representation |
---|---|
bin | 10111011011010100001000… |
… | …011000110111011111010100 |
3 | 111111210202212222110210100101 |
4 | 113123110020120313133110 |
5 | 102001034230431401322 |
6 | 1003044144244423444 |
7 | 30462552523121005 |
oct | 2733241030673724 |
9 | 444722788423311 |
10 | 103032111200212 |
11 | 2a913744804947 |
12 | b6803916a7b84 |
13 | 4564b6a54aa1c |
14 | 1b62ad06b71ac |
15 | bda17d168327 |
hex | 5db5086377d4 |
103032111200212 has 24 divisors (see below), whose sum is σ = 189804272192640. Its totient is φ = 48802555656000.
The previous prime is 103032111200209. The next prime is 103032111200219. The reversal of 103032111200212 is 212002111230301.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 103032111200212.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103032111200219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 27809164 + ... + 31295587.
It is an arithmetic number, because the mean of its divisors is an integer number (7908511341360).
Almost surely, 2103032111200212 is an apocalyptic number.
It is an amenable number.
103032111200212 is a deficient number, since it is larger than the sum of its proper divisors (86772160992428).
103032111200212 is a wasteful number, since it uses less digits than its factorization.
103032111200212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59127711 (or 59127709 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 103032111200212 its reverse (212002111230301), we get a palindrome (315034222430513).
The spelling of 103032111200212 in words is "one hundred three trillion, thirty-two billion, one hundred eleven million, two hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •