Base | Representation |
---|---|
bin | 10111000010100100110011… |
… | …001011101111110110011011 |
3 | 111021210020122211221211200022 |
4 | 113002210303023233312123 |
5 | 101240210440131211443 |
6 | 555303142135501055 |
7 | 30225665654353466 |
oct | 2702446313576633 |
9 | 437706584854608 |
10 | 101332022132123 |
11 | 2a31873a856172 |
12 | b4469a922778b |
13 | 447075152b553 |
14 | 1b046d31c22dd |
15 | baad29b03e68 |
hex | 5c29332efd9b |
101332022132123 has 4 divisors (see below), whose sum is σ = 105737762224848. Its totient is φ = 96926282039400.
The previous prime is 101332022132119. The next prime is 101332022132129. The reversal of 101332022132123 is 321231220233101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101332022132123 - 22 = 101332022132119 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101332022132092 and 101332022132101.
It is not an unprimeable number, because it can be changed into a prime (101332022132129) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2202870046328 + ... + 2202870046373.
It is an arithmetic number, because the mean of its divisors is an integer number (26434440556212).
Almost surely, 2101332022132123 is an apocalyptic number.
101332022132123 is a deficient number, since it is larger than the sum of its proper divisors (4405740092725).
101332022132123 is an equidigital number, since it uses as much as digits as its factorization.
101332022132123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4405740092724.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 101332022132123 its reverse (321231220233101), we get a palindrome (422563242365224).
The spelling of 101332022132123 in words is "one hundred one trillion, three hundred thirty-two billion, twenty-two million, one hundred thirty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •