Base | Representation |
---|---|
bin | 10111000010001000000000… |
… | …110100001011011111100111 |
3 | 111021200021212200200210110211 |
4 | 113002020000310023133213 |
5 | 101234204134223301043 |
6 | 555241031043200251 |
7 | 30223522666330165 |
oct | 2702100064133747 |
9 | 437607780623424 |
10 | 101301112322023 |
11 | 2a306618a9a369 |
12 | b440a01676087 |
13 | 446a8668167a3 |
14 | 1b02ddddc6235 |
15 | baa11b1b1a9d |
hex | 5c2200d0b7e7 |
101301112322023 has 12 divisors (see below), whose sum is σ = 108907036527240. Its totient is φ = 94193521853312.
The previous prime is 101301112321993. The next prime is 101301112322077. The reversal of 101301112322023 is 320223211103101.
It is not a de Polignac number, because 101301112322023 - 217 = 101301112190951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101301112321985 and 101301112322003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101301112323023) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2111559628 + ... + 2111607601.
It is an arithmetic number, because the mean of its divisors is an integer number (9075586377270).
Almost surely, 2101301112322023 is an apocalyptic number.
101301112322023 is a deficient number, since it is larger than the sum of its proper divisors (7605924205217).
101301112322023 is an equidigital number, since it uses as much as digits as its factorization.
101301112322023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4223167346 (or 4223167329 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 101301112322023 its reverse (320223211103101), we get a palindrome (421524323425124).
The spelling of 101301112322023 in words is "one hundred one trillion, three hundred one billion, one hundred twelve million, three hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •