Base | Representation |
---|---|
bin | 10110011000011101… |
… | …00011100101110010 |
3 | 1011000102210102002220 |
4 | 23030032203211302 |
5 | 144102133134300 |
6 | 5304211021510 |
7 | 603526612515 |
oct | 131416434562 |
9 | 34012712086 |
10 | 12016302450 |
11 | 5106986979 |
12 | 23b429a896 |
13 | 1196651c49 |
14 | 81dc62d7c |
15 | 4a4de0da0 |
hex | 2cc3a3972 |
12016302450 has 48 divisors (see below), whose sum is σ = 29828912256. Its totient is φ = 3201284800.
The previous prime is 12016302433. The next prime is 12016302499. The reversal of 12016302450 is 5420361021.
12016302450 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 12016302450.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 121399 + ... + 196901.
It is an arithmetic number, because the mean of its divisors is an integer number (621435672).
Almost surely, 212016302450 is an apocalyptic number.
12016302450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12016302450 is an abundant number, since it is smaller than the sum of its proper divisors (17812609806).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12016302450 is a wasteful number, since it uses less digits than its factorization.
12016302450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76579 (or 76574 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 24.
Adding to 12016302450 its reverse (5420361021), we get a palindrome (17436663471).
The spelling of 12016302450 in words is "twelve billion, sixteen million, three hundred two thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •