Base | Representation |
---|---|
bin | 11000011001110000… |
… | …10111011111110111 |
3 | 1020211000211222222200 |
4 | 30030320113133313 |
5 | 203312324123131 |
6 | 10003555555543 |
7 | 642440463150 |
oct | 141470273767 |
9 | 36730758880 |
10 | 13101004791 |
11 | 56131a2896 |
12 | 26575bbbb3 |
13 | 130a2a7954 |
14 | 8c3d3c927 |
15 | 51a2542e6 |
hex | 30ce177f7 |
13101004791 has 24 divisors (see below), whose sum is σ = 21633865344. Its totient is φ = 7483931280.
The previous prime is 13101004781. The next prime is 13101004793. The reversal of 13101004791 is 19740010131.
It is not a de Polignac number, because 13101004791 - 27 = 13101004663 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13101004793) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 179796 + ... + 241926.
It is an arithmetic number, because the mean of its divisors is an integer number (901411056).
Almost surely, 213101004791 is an apocalyptic number.
13101004791 is a deficient number, since it is larger than the sum of its proper divisors (8532860553).
13101004791 is a wasteful number, since it uses less digits than its factorization.
13101004791 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65491 (or 65488 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 27.
The spelling of 13101004791 in words is "thirteen billion, one hundred one million, four thousand, seven hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •