Base | Representation |
---|---|
bin | 1011000011010010011001… |
… | …0100101011101001010000 |
3 | 1121000122010102121121002222 |
4 | 2300310212110223221100 |
5 | 3043040430442424430 |
6 | 41502050224000212 |
7 | 2362613502020651 |
oct | 260644624535120 |
9 | 47018112547088 |
10 | 12151105436240 |
11 | 3965289270621 |
12 | 1442b70760068 |
13 | 6a1ac8ca4214 |
14 | 30018c0c5528 |
15 | 161128aab9e5 |
hex | b0d2652ba50 |
12151105436240 has 80 divisors (see below), whose sum is σ = 28362288435456. Its totient is φ = 4841359372800.
The previous prime is 12151105436189. The next prime is 12151105436269. The reversal of 12151105436240 is 4263450115121.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is a self number, because there is not a number n which added to its sum of digits gives 12151105436240.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94525610 + ... + 94654070.
Almost surely, 212151105436240 is an apocalyptic number.
12151105436240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12151105436240 is an abundant number, since it is smaller than the sum of its proper divisors (16211182999216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12151105436240 is a wasteful number, since it uses less digits than its factorization.
12151105436240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133108 (or 133102 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 35.
The spelling of 12151105436240 in words is "twelve trillion, one hundred fifty-one billion, one hundred five million, four hundred thirty-six thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •