Base | Representation |
---|---|
bin | 10110100011010001… |
… | …10110011011101000 |
3 | 1011020202121110111000 |
4 | 23101220312123220 |
5 | 144243403101243 |
6 | 5321212435000 |
7 | 606011331360 |
oct | 132150663350 |
9 | 34222543430 |
10 | 12107081448 |
11 | 515314a540 |
12 | 241a778a60 |
13 | 11ac3b7627 |
14 | 82bd339a0 |
15 | 4acd735d3 |
hex | 2d1a366e8 |
12107081448 has 128 divisors (see below), whose sum is σ = 41929344000. Its totient is φ = 3144692160.
The previous prime is 12107081411. The next prime is 12107081449. The reversal of 12107081448 is 84418070121.
12107081448 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (12107081449) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 347338 + ... + 380601.
It is an arithmetic number, because the mean of its divisors is an integer number (327573000).
Almost surely, 212107081448 is an apocalyptic number.
12107081448 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
12107081448 is an abundant number, since it is smaller than the sum of its proper divisors (29822262552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12107081448 is a wasteful number, since it uses less digits than its factorization.
12107081448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 727972 (or 727962 counting only the distinct ones).
The product of its (nonzero) digits is 14336, while the sum is 36.
The spelling of 12107081448 in words is "twelve billion, one hundred seven million, eighty-one thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •