Base | Representation |
---|---|
bin | 101111010011010101… |
… | …0100011111111100011 |
3 | 100201012022111011020001 |
4 | 1132212222203333203 |
5 | 3131014042020024 |
6 | 114355421000431 |
7 | 10224154231066 |
oct | 1364652437743 |
9 | 321168434201 |
10 | 101580423139 |
11 | 3a097556428 |
12 | 1782b0b3117 |
13 | 976b07c870 |
14 | 4cb8cda8dd |
15 | 2997d6d244 |
hex | 17a6aa3fe3 |
101580423139 has 16 divisors (see below), whose sum is σ = 110803593600. Its totient is φ = 92559108096.
The previous prime is 101580423127. The next prime is 101580423157. The reversal of 101580423139 is 931324085101.
It is not a de Polignac number, because 101580423139 - 27 = 101580423011 is a prime.
It is a super-2 number, since 2×1015804231392 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101580423098 and 101580423107.
It is not an unprimeable number, because it can be changed into a prime (101580421139) 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 15 ways as a sum of consecutive naturals, for example, 6516747 + ... + 6532315.
It is an arithmetic number, because the mean of its divisors is an integer number (6925224600).
Almost surely, 2101580423139 is an apocalyptic number.
101580423139 is a deficient number, since it is larger than the sum of its proper divisors (9223170461).
101580423139 is a wasteful number, since it uses less digits than its factorization.
101580423139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22014.
The product of its (nonzero) digits is 25920, while the sum is 37.
The spelling of 101580423139 in words is "one hundred one billion, five hundred eighty million, four hundred twenty-three thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •