Base | Representation |
---|---|
bin | 101111100000001011… |
… | …0011000110110010111 |
3 | 100202022100100010002102 |
4 | 1133000112120312113 |
5 | 3132404400422411 |
6 | 114510253032315 |
7 | 10240636050011 |
oct | 1370026306627 |
9 | 322270303072 |
10 | 102011342231 |
11 | 3a29881a307 |
12 | 1792b48569b |
13 | 9809428586 |
14 | 4d1a22d1b1 |
15 | 29c0adcd3b |
hex | 17c0598d97 |
102011342231 has 8 divisors (see below), whose sum is σ = 103429229904. Its totient is φ = 100594008000.
The previous prime is 102011342201. The next prime is 102011342339. The reversal of 102011342231 is 132243110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102011342231 is a prime.
It is a super-2 number, since 2×1020113422312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011342201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 239981 + ... + 511481.
It is an arithmetic number, because the mean of its divisors is an integer number (12928653738).
Almost surely, 2102011342231 is an apocalyptic number.
102011342231 is a deficient number, since it is larger than the sum of its proper divisors (1417887673).
102011342231 is an equidigital number, since it uses as much as digits as its factorization.
102011342231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276721.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 102011342231 its reverse (132243110201), we get a palindrome (234254452432).
The spelling of 102011342231 in words is "one hundred two billion, eleven million, three hundred forty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •