Base | Representation |
---|---|
bin | 10111101001100101101011… |
… | …101101001000011000000011 |
3 | 111122021112210220020211010022 |
4 | 113221211223231020120003 |
5 | 102113122141140001011 |
6 | 1005114532030524055 |
7 | 30623456563262060 |
oct | 2751455355103003 |
9 | 448245726224108 |
10 | 104013030000131 |
11 | 3016175090379a |
12 | b7ba50936662b |
13 | 46065045b8415 |
14 | 1b98386889c67 |
15 | c0593e6558db |
hex | 5e996bb48603 |
104013030000131 has 16 divisors (see below), whose sum is σ = 119556300464640. Its totient is φ = 88640994220800.
The previous prime is 104013030000107. The next prime is 104013030000137. The reversal of 104013030000131 is 131000030310401.
It is not a de Polignac number, because 104013030000131 - 214 = 104013029983747 is a prime.
It is a super-2 number, since 2×1040130300001312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (104013030000137) 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, 423731 + ... + 14429331.
It is an arithmetic number, because the mean of its divisors is an integer number (7472268779040).
Almost surely, 2104013030000131 is an apocalyptic number.
104013030000131 is a deficient number, since it is larger than the sum of its proper divisors (15543270464509).
104013030000131 is a wasteful number, since it uses less digits than its factorization.
104013030000131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14011714.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 104013030000131 its reverse (131000030310401), we get a palindrome (235013060310532).
The spelling of 104013030000131 in words is "one hundred four trillion, thirteen billion, thirty million, one hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •