Base | Representation |
---|---|
bin | 1010011110010100101010… |
… | …11101001101000101010101 |
3 | 10000112211221012010122022002 |
4 | 11033022111131031011111 |
5 | 11004324241224231401 |
6 | 120552451045445045 |
7 | 4565005312444310 |
oct | 517122535150525 |
9 | 100484835118262 |
10 | 23032122102101 |
11 | 737a960531532 |
12 | 26bb943110785 |
13 | cb0bc5a34a38 |
14 | 598a9135d977 |
15 | 29e1b9684a6b |
hex | 14f29574d155 |
23032122102101 has 64 divisors (see below), whose sum is σ = 28108800921600. Its totient is φ = 18453258432000.
The previous prime is 23032122102061. The next prime is 23032122102107. The reversal of 23032122102101 is 10120122123032.
It is not a de Polignac number, because 23032122102101 - 210 = 23032122101077 is a prime.
It is a super-2 number, since 2×230321221021012 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (23032122102107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3298309856 + ... + 3298316838.
It is an arithmetic number, because the mean of its divisors is an integer number (439200014400).
Almost surely, 223032122102101 is an apocalyptic number.
It is an amenable number.
23032122102101 is a deficient number, since it is larger than the sum of its proper divisors (5076678819499).
23032122102101 is a wasteful number, since it uses less digits than its factorization.
23032122102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10050.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 23032122102101 its reverse (10120122123032), we get a palindrome (33152244225133).
The spelling of 23032122102101 in words is "twenty-three trillion, thirty-two billion, one hundred twenty-two million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •