Base | Representation |
---|---|
bin | 1011111010100001011101… |
… | …1010010011100000010001 |
3 | 1201101100111112002201220112 |
4 | 2332220113122103200101 |
5 | 3204112342003240101 |
6 | 43510024321451105 |
7 | 2521306164312434 |
oct | 276502732234021 |
9 | 51340445081815 |
10 | 13100043024401 |
11 | 41a0773851753 |
12 | 1576a61aa0a95 |
13 | 740437380188 |
14 | 33408ca8581b |
15 | 17ab6756e6bb |
hex | bea17693811 |
13100043024401 has 8 divisors (see below), whose sum is σ = 13289502245184. Its totient is φ = 12910721347440.
The previous prime is 13100043024379. The next prime is 13100043024421. The reversal of 13100043024401 is 10442034000131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13100043024401 is a prime.
It is a super-2 number, since 2×131000430244012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13100043024421) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34194086 + ... + 34575071.
It is an arithmetic number, because the mean of its divisors is an integer number (1661187780648).
Almost surely, 213100043024401 is an apocalyptic number.
It is an amenable number.
13100043024401 is a deficient number, since it is larger than the sum of its proper divisors (189459220783).
13100043024401 is an equidigital number, since it uses as much as digits as its factorization.
13100043024401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68771911.
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 13100043024401 its reverse (10442034000131), we get a palindrome (23542077024532).
The spelling of 13100043024401 in words is "thirteen trillion, one hundred billion, forty-three million, twenty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •