Base | Representation |
---|---|
bin | 101111001011001110… |
… | …0111011000100101101 |
3 | 100200111100122120101000 |
4 | 1132112130323010231 |
5 | 3124434423142310 |
6 | 114312422510513 |
7 | 10214342203230 |
oct | 1362634730455 |
9 | 320440576330 |
10 | 101308412205 |
11 | 39a67a59600 |
12 | 17773b95439 |
13 | 9726901650 |
14 | 4c90b31417 |
15 | 297e03c4c0 |
hex | 179673b12d |
101308412205 has 768 divisors, whose sum is σ = 272847052800. Its totient is φ = 34488115200.
The previous prime is 101308412201. The next prime is 101308412267. The reversal of 101308412205 is 502214803101.
101308412205 is a `hidden beast` number, since 10 + 1 + 30 + 8 + 412 + 205 = 666.
It is not a de Polignac number, because 101308412205 - 22 = 101308412201 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101308412201) by changing a digit.
It is a polite number, since it can be written in 767 ways as a sum of consecutive naturals, for example, 480134550 + ... + 480134760.
It is an arithmetic number, because the mean of its divisors is an integer number (355269600).
Almost surely, 2101308412205 is an apocalyptic number.
101308412205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
101308412205 is an abundant number, since it is smaller than the sum of its proper divisors (171538640595).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101308412205 is a wasteful number, since it uses less digits than its factorization.
101308412205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303 (or 286 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 27.
The spelling of 101308412205 in words is "one hundred one billion, three hundred eight million, four hundred twelve thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •