Base | Representation |
---|---|
bin | 1001000110101110011001… |
… | …1100111000110101110100 |
3 | 1022110001111120100121022201 |
4 | 2101223212130320311310 |
5 | 2303010303333212322 |
6 | 33143015420434244 |
7 | 2052165246041002 |
oct | 221534634706564 |
9 | 38401446317281 |
10 | 10011140132212 |
11 | 320a77868425a |
12 | 11582866a8984 |
13 | 57807b10842b |
14 | 268782879a72 |
15 | 12562ce62d27 |
hex | 91ae6738d74 |
10011140132212 has 12 divisors (see below), whose sum is σ = 17528711181156. Its totient is φ = 5002936937600.
The previous prime is 10011140132179. The next prime is 10011140132249. The reversal of 10011140132212 is 21223104111001.
It can be written as a sum of positive squares in 2 ways, for example, as 255425116816 + 9755715015396 = 505396^2 + 3123414^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 10011140132212.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 658273573 + ... + 658288780.
It is an arithmetic number, because the mean of its divisors is an integer number (1460725931763).
Almost surely, 210011140132212 is an apocalyptic number.
It is an amenable number.
10011140132212 is a deficient number, since it is larger than the sum of its proper divisors (7517571048944).
10011140132212 is a wasteful number, since it uses less digits than its factorization.
10011140132212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1316564258 (or 1316564256 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10011140132212 its reverse (21223104111001), we get a palindrome (31234244243213).
The spelling of 10011140132212 in words is "ten trillion, eleven billion, one hundred forty million, one hundred thirty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •