Base | Representation |
---|---|
bin | 1011111011110111001001… |
… | …0100011001111110110000 |
3 | 1201110112212102200122112120 |
4 | 2332331302110121332300 |
5 | 3210001443004304300 |
6 | 43524350455554240 |
7 | 2523052145242131 |
oct | 276756224317660 |
9 | 51415772618476 |
10 | 13123043041200 |
11 | 41aa4a67527a4 |
12 | 157b40068b980 |
13 | 742661446b81 |
14 | 335231579c88 |
15 | 17b5618843a0 |
hex | bef72519fb0 |
13123043041200 has 120 divisors (see below), whose sum is σ = 42042618833808. Its totient is φ = 3499050455040.
The previous prime is 13123043041193. The next prime is 13123043041231. The reversal of 13123043041200 is 214034032131.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×131230430412002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 9215452 + ... + 10543748.
Almost surely, 213123043041200 is an apocalyptic number.
13123043041200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13123043041200 is an abundant number, since it is smaller than the sum of its proper divisors (28919575792608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13123043041200 is a wasteful number, since it uses less digits than its factorization.
13123043041200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1336551 (or 1336540 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 13123043041200 its reverse (214034032131), we get a palindrome (13337077073331).
The spelling of 13123043041200 in words is "thirteen trillion, one hundred twenty-three billion, forty-three million, forty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •