Base | Representation |
---|---|
bin | 10110111111100000010111… |
… | …011000000110110000011011 |
3 | 111021001002020110220202001102 |
4 | 112333200113120012300123 |
5 | 101223232004131241443 |
6 | 555022220521542015 |
7 | 30204521115542150 |
oct | 2677402730066033 |
9 | 437032213822042 |
10 | 101121102212123 |
11 | 2a247244a824a4 |
12 | b411b4464490b |
13 | 44568a9a72666 |
14 | 1ad8404b18227 |
15 | ba55d2b5ccb8 |
hex | 5bf817606c1b |
101121102212123 has 8 divisors (see below), whose sum is σ = 115569504634848. Its totient is φ = 86673332458944.
The previous prime is 101121102212101. The next prime is 101121102212147. The reversal of 101121102212123 is 321212201121101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101121102212123 - 28 = 101121102211867 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101121102212095 and 101121102212104.
It is not an unprimeable number, because it can be changed into a prime (101121102202123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 157824836 + ... + 158464257.
It is an arithmetic number, because the mean of its divisors is an integer number (14446188079356).
Almost surely, 2101121102212123 is an apocalyptic number.
101121102212123 is a deficient number, since it is larger than the sum of its proper divisors (14448402422725).
101121102212123 is an equidigital number, since it uses as much as digits as its factorization.
101121102212123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 316334773.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 101121102212123 its reverse (321212201121101), we get a palindrome (422333303333224).
The spelling of 101121102212123 in words is "one hundred one trillion, one hundred twenty-one billion, one hundred two million, two hundred twelve thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •