Base | Representation |
---|---|
bin | 10000000010010101000… |
… | …011010100001101000111 |
3 | 10220100111010120022100001 |
4 | 100002111003110031013 |
5 | 121023410122132101 |
6 | 2202131340102131 |
7 | 142421615004445 |
oct | 20022503241507 |
9 | 3810433508301 |
10 | 1102012302151 |
11 | 3953a7240422 |
12 | 1596b1834947 |
13 | 7cbc496bcc7 |
14 | 3b4a2845b95 |
15 | 1d9ec493901 |
hex | 100950d4347 |
1102012302151 has 2 divisors, whose sum is σ = 1102012302152. Its totient is φ = 1102012302150.
The previous prime is 1102012302133. The next prime is 1102012302197. The reversal of 1102012302151 is 1512032102011.
It is a weak prime.
It is an emirp because it is prime and its reverse (1512032102011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1102012302151 - 29 = 1102012301639 is a prime.
It is a super-2 number, since 2×11020123021512 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1102012302551) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 551006151075 + 551006151076.
It is an arithmetic number, because the mean of its divisors is an integer number (551006151076).
Almost surely, 21102012302151 is an apocalyptic number.
1102012302151 is a deficient number, since it is larger than the sum of its proper divisors (1).
1102012302151 is an equidigital number, since it uses as much as digits as its factorization.
1102012302151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 120, while the sum is 19.
Adding to 1102012302151 its reverse (1512032102011), we get a palindrome (2614044404162).
The spelling of 1102012302151 in words is "one trillion, one hundred two billion, twelve million, three hundred two thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •