Base | Representation |
---|---|
bin | 1011001001001110100011… |
… | …0111110100010011010010 |
3 | 1121101101112100101012222010 |
4 | 2302103220313310103102 |
5 | 3101223424320040300 |
6 | 42021004315523350 |
7 | 2403155366520303 |
oct | 262235067642322 |
9 | 47341470335863 |
10 | 12253153674450 |
11 | 39a45958a0377 |
12 | 145a8b0459556 |
13 | 6ab60cc4a520 |
14 | 3050ad19a7aa |
15 | 163aeca36a50 |
hex | b24e8df44d2 |
12253153674450 has 48 divisors (see below), whose sum is σ = 32725345818816. Its totient is φ = 3016160904000.
The previous prime is 12253153674431. The next prime is 12253153674481. The reversal of 12253153674450 is 5447635135221.
12253153674450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 12253153674450.
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, 3141832326 + ... + 3141836225.
It is an arithmetic number, because the mean of its divisors is an integer number (681778037892).
Almost surely, 212253153674450 is an apocalyptic number.
12253153674450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12253153674450 is an abundant number, since it is smaller than the sum of its proper divisors (20472192144366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12253153674450 is a wasteful number, since it uses less digits than its factorization.
12253153674450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6283668579 (or 6283668574 counting only the distinct ones).
The product of its (nonzero) digits is 3024000, while the sum is 48.
The spelling of 12253153674450 in words is "twelve trillion, two hundred fifty-three billion, one hundred fifty-three million, six hundred seventy-four thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.037 sec. • engine limits •