Base | Representation |
---|---|
bin | 1011110101010010011100… |
… | …1010100100000111110000 |
3 | 1201001202101010221012020121 |
4 | 2331110213022210013300 |
5 | 3201124202413123100 |
6 | 43400432521420024 |
7 | 2511643505015026 |
oct | 275244712440760 |
9 | 51052333835217 |
10 | 13010113020400 |
11 | 41666156996a1 |
12 | 156154463a614 |
13 | 734b04bc7962 |
14 | 32d99b1a8716 |
15 | 17865241c51a |
hex | bd5272a41f0 |
13010113020400 has 30 divisors (see below), whose sum is σ = 31256796532472. Its totient is φ = 5204045208000.
The previous prime is 13010113020379. The next prime is 13010113020409. The reversal of 13010113020400 is 402031101031.
It is a super-2 number, since 2×130101130204002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13010113020409) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 16262640876 + ... + 16262641675.
Almost surely, 213010113020400 is an apocalyptic number.
13010113020400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13010113020400 is an abundant number, since it is smaller than the sum of its proper divisors (18246683512072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13010113020400 is a wasteful number, since it uses less digits than its factorization.
13010113020400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32525282569 (or 32525282558 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 13010113020400 its reverse (402031101031), we get a palindrome (13412144121431).
The spelling of 13010113020400 in words is "thirteen trillion, ten billion, one hundred thirteen million, twenty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •