Base | Representation |
---|---|
bin | 10000000011010001110… |
… | …001010110000001111100 |
3 | 10220110010010102120201220 |
4 | 100003101301112001330 |
5 | 121033001414014322 |
6 | 2202420410233340 |
7 | 142456064545530 |
oct | 20032161260174 |
9 | 3813103376656 |
10 | 1103031001212 |
11 | 39587a276078 |
12 | 159936a25850 |
13 | 80027a2540a |
14 | 3b55bc5dbc0 |
15 | 1da5bb1a55c |
hex | 100d1c5607c |
1103031001212 has 48 divisors (see below), whose sum is σ = 2946261964800. Its totient is φ = 314632504512.
The previous prime is 1103031001187. The next prime is 1103031001213. The reversal of 1103031001212 is 2121001303011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1103031001191 and 1103031001200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1103031001213) 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, 10765587 + ... + 10867562.
It is an arithmetic number, because the mean of its divisors is an integer number (61380457600).
Almost surely, 21103031001212 is an apocalyptic number.
1103031001212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1103031001212 is an abundant number, since it is smaller than the sum of its proper divisors (1843230963588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1103031001212 is a wasteful number, since it uses less digits than its factorization.
1103031001212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21633770 (or 21633768 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1103031001212 its reverse (2121001303011), we get a palindrome (3224032304223).
The spelling of 1103031001212 in words is "one trillion, one hundred three billion, thirty-one million, one thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •