Base | Representation |
---|---|
bin | 101111000101101101… |
… | …0000101101110010111 |
3 | 100200000102222202021121 |
4 | 1132023122011232113 |
5 | 3124100004320043 |
6 | 114242203224411 |
7 | 10206632223622 |
oct | 1361332055627 |
9 | 320012882247 |
10 | 101123120023 |
11 | 39982401872 |
12 | 17721b18107 |
13 | 96c73c69c3 |
14 | 4c7429adb9 |
15 | 296cb3aded |
hex | 178b685b97 |
101123120023 has 4 divisors (see below), whose sum is σ = 101602376728. Its totient is φ = 100643863320.
The previous prime is 101123120017. The next prime is 101123120027. The reversal of 101123120023 is 320021321101.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320021321101 = 29 ⋅11035217969.
It is a cyclic number.
It is not a de Polignac number, because 101123120023 - 233 = 92533185431 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101123119979 and 101123120006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101123120027) 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, 239628036 + ... + 239628457.
It is an arithmetic number, because the mean of its divisors is an integer number (25400594182).
Almost surely, 2101123120023 is an apocalyptic number.
101123120023 is a deficient number, since it is larger than the sum of its proper divisors (479256705).
101123120023 is an equidigital number, since it uses as much as digits as its factorization.
101123120023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 479256704.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 101123120023 its reverse (320021321101), we get a palindrome (421144441124).
The spelling of 101123120023 in words is "one hundred one billion, one hundred twenty-three million, one hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •