Base | Representation |
---|---|
bin | 1011001100110011010000… |
… | …0111000011001111100000 |
3 | 1121121020222211221011000110 |
4 | 2303030310013003033200 |
5 | 3103230142122014102 |
6 | 42105120223451320 |
7 | 2410460626446636 |
oct | 263146407031740 |
9 | 47536884834013 |
10 | 12314545501152 |
11 | 3a18629994434 |
12 | 146a784456b40 |
13 | 6b4344b53bbb |
14 | 308054835356 |
15 | 1654e256786c |
hex | b33341c33e0 |
12314545501152 has 24 divisors (see below), whose sum is σ = 32325681940776. Its totient is φ = 4104848500352.
The previous prime is 12314545501133. The next prime is 12314545501183. The reversal of 12314545501152 is 25110554541321.
It is a tau number, because it is divible by the number of its divisors (24).
It is a self number, because there is not a number n which added to its sum of digits gives 12314545501152.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 64138257723 + ... + 64138257914.
It is an arithmetic number, because the mean of its divisors is an integer number (1346903414199).
Almost surely, 212314545501152 is an apocalyptic number.
12314545501152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12314545501152 is an abundant number, since it is smaller than the sum of its proper divisors (20011136439624).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12314545501152 is a wasteful number, since it uses less digits than its factorization.
12314545501152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128276515650 (or 128276515642 counting only the distinct ones).
The product of its (nonzero) digits is 120000, while the sum is 39.
The spelling of 12314545501152 in words is "twelve trillion, three hundred fourteen billion, five hundred forty-five million, five hundred one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •