Base | Representation |
---|---|
bin | 10110010111101000… |
… | …00111011011000010 |
3 | 1010222221202021101202 |
4 | 23023310013123002 |
5 | 144043344340310 |
6 | 5303402301202 |
7 | 603413654255 |
oct | 131364073302 |
9 | 33887667352 |
10 | 12009371330 |
11 | 5102a82480 |
12 | 23b1ab7802 |
13 | 11950961a8 |
14 | 81cd7b09c |
15 | 4a44c23a5 |
hex | 2cbd076c2 |
12009371330 has 16 divisors (see below), whose sum is σ = 23582038464. Its totient is φ = 4367044080.
The previous prime is 12009371293. The next prime is 12009371347. The reversal of 12009371330 is 3317390021.
12009371330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 12009371293 and 12009371302.
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 7 ways as a sum of consecutive naturals, for example, 54587942 + ... + 54588161.
It is an arithmetic number, because the mean of its divisors is an integer number (1473877404).
Almost surely, 212009371330 is an apocalyptic number.
12009371330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12009371330 is a deficient number, since it is larger than the sum of its proper divisors (11572667134).
12009371330 is a wasteful number, since it uses less digits than its factorization.
12009371330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109176121.
The product of its (nonzero) digits is 3402, while the sum is 29.
The spelling of 12009371330 in words is "twelve billion, nine million, three hundred seventy-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •