Base | Representation |
---|---|
bin | 10111001100011110001011… |
… | …000010110111110010001101 |
3 | 111101012021001201101112221221 |
4 | 113030132023002313302031 |
5 | 101332331240331024401 |
6 | 1000543413502523341 |
7 | 30326062650551230 |
oct | 2714361302676215 |
9 | 441167051345857 |
10 | 102012101033101 |
11 | 2a5600a8646266 |
12 | b536766296551 |
13 | 44bc91375791c |
14 | 1b295aa89d417 |
15 | bbd87ed287a1 |
hex | 5cc78b0b7c8d |
102012101033101 has 16 divisors (see below), whose sum is σ = 116627270903424. Its totient is φ = 87407436662784.
The previous prime is 102012101033093. The next prime is 102012101033111. The reversal of 102012101033101 is 101330101210201.
It is a happy number.
It is not a de Polignac number, because 102012101033101 - 23 = 102012101033093 is a prime.
It is a super-2 number, since 2×1020121010331012 (a number of 29 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 (102012101033111) 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, 618348841 + ... + 618513793.
It is an arithmetic number, because the mean of its divisors is an integer number (7289204431464).
Almost surely, 2102012101033101 is an apocalyptic number.
It is an amenable number.
102012101033101 is a deficient number, since it is larger than the sum of its proper divisors (14615169870323).
102012101033101 is a wasteful number, since it uses less digits than its factorization.
102012101033101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196260.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 102012101033101 its reverse (101330101210201), we get a palindrome (203342202243302).
The spelling of 102012101033101 in words is "one hundred two trillion, twelve billion, one hundred one million, thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •