Base | Representation |
---|---|
bin | 1100010010000110111100… |
… | …0010100100111100010000 |
3 | 1202211002101101221011221010 |
4 | 3010201233002210330100 |
5 | 3232232212433001300 |
6 | 44420115513530520 |
7 | 2562502303662015 |
oct | 304415702447420 |
9 | 52732341834833 |
10 | 13505240125200 |
11 | 43375a3a7387a |
12 | 16214a5713a40 |
13 | 76c70062a895 |
14 | 34992b17570c |
15 | 186480354a50 |
hex | c486f0a4f10 |
13505240125200 has 120 divisors (see below), whose sum is σ = 43290845850400. Its totient is φ = 3598978222080.
The previous prime is 13505240125193. The next prime is 13505240125217. The reversal of 13505240125200 is 252104250531.
It is a tau number, because it is divible by the number of its divisors (120).
It is a super-2 number, since 2×135052401252002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 1992370 + ... + 5565969.
Almost surely, 213505240125200 is an apocalyptic number.
13505240125200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13505240125200 is an abundant number, since it is smaller than the sum of its proper divisors (29785605725200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13505240125200 is a wasteful number, since it uses less digits than its factorization.
13505240125200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7559849 (or 7559838 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 13505240125200 its reverse (252104250531), we get a palindrome (13757344375731).
The spelling of 13505240125200 in words is "thirteen trillion, five hundred five billion, two hundred forty million, one hundred twenty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •