Base | Representation |
---|---|
bin | 10111000000101010110010… |
… | …110110101010010111010110 |
3 | 111021022201112002112012021111 |
4 | 113000222302312222113112 |
5 | 101231034142121231402 |
6 | 555123035023405234 |
7 | 30213350422442014 |
oct | 2700526266522726 |
9 | 437281462465244 |
10 | 101201020102102 |
11 | 2a2781255a7058 |
12 | b425528a5381a |
13 | 44612a4b8885b |
14 | 1adc2269db8b4 |
15 | ba770dd0c9d7 |
hex | 5c0ab2daa5d6 |
101201020102102 has 16 divisors (see below), whose sum is σ = 159876671567040. Its totient is φ = 47911649152968.
The previous prime is 101201020102097. The next prime is 101201020102151. The reversal of 101201020102102 is 201201020102101.
It is a super-3 number, since 3×1012010201021023 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 713154748 + ... + 713296639.
It is an arithmetic number, because the mean of its divisors is an integer number (9992291972940).
Almost surely, 2101201020102102 is an apocalyptic number.
101201020102102 is a deficient number, since it is larger than the sum of its proper divisors (58675651464938).
101201020102102 is a wasteful number, since it uses less digits than its factorization.
101201020102102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1426453275.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101201020102102 its reverse (201201020102101), we get a palindrome (302402040204203).
Subtracting 101201020102102 from its reverse (201201020102101), we obtain a palindrome (99999999999999).
The spelling of 101201020102102 in words is "one hundred one trillion, two hundred one billion, twenty million, one hundred two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •