Base | Representation |
---|---|
bin | 1011110111001001001111… |
… | …0110011001101010011100 |
3 | 1201011210200111012200200102 |
4 | 2331302103312121222130 |
5 | 3202140004303103200 |
6 | 43423225044320232 |
7 | 2514152643164501 |
oct | 275622366315234 |
9 | 51153614180612 |
10 | 13042001222300 |
11 | 417909975a766 |
12 | 15677639a3078 |
13 | 737b1752248b |
14 | 3313442c94a8 |
15 | 1793bbbc36d5 |
hex | bdc93d99a9c |
13042001222300 has 72 divisors (see below), whose sum is σ = 28385033929056. Its totient is φ = 5201340559360.
The previous prime is 13042001222281. The next prime is 13042001222303. The reversal of 13042001222300 is 322210024031.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13042001222303) 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, 335224649 + ... + 335263551.
It is an arithmetic number, because the mean of its divisors is an integer number (394236582348).
Almost surely, 213042001222300 is an apocalyptic number.
13042001222300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13042001222300 is an abundant number, since it is smaller than the sum of its proper divisors (15343032706756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13042001222300 is a wasteful number, since it uses less digits than its factorization.
13042001222300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48767 (or 48760 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 13042001222300 its reverse (322210024031), we get a palindrome (13364211246331).
The spelling of 13042001222300 in words is "thirteen trillion, forty-two billion, one million, two hundred twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •