Base | Representation |
---|---|
bin | 10110011001110111… |
… | …11111100111101100 |
3 | 1011001021012120022210 |
4 | 23030323333213230 |
5 | 144113210314430 |
6 | 5305314210420 |
7 | 604033062354 |
oct | 131473774754 |
9 | 34037176283 |
10 | 12028213740 |
11 | 5112682014 |
12 | 23b8283a10 |
13 | 1198c6274a |
14 | 821683b64 |
15 | 4a5e952b0 |
hex | 2cceff9ec |
12028213740 has 24 divisors (see below), whose sum is σ = 33678998640. Its totient is φ = 3207523648.
The previous prime is 12028213733. The next prime is 12028213787. The reversal of 12028213740 is 4731282021.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 12028213698 and 12028213707.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 100235055 + ... + 100235174.
It is an arithmetic number, because the mean of its divisors is an integer number (1403291610).
Almost surely, 212028213740 is an apocalyptic number.
12028213740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12028213740 is an abundant number, since it is smaller than the sum of its proper divisors (21650784900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12028213740 is a wasteful number, since it uses less digits than its factorization.
12028213740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200470241 (or 200470239 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 30.
Adding to 12028213740 its reverse (4731282021), we get a palindrome (16759495761).
The spelling of 12028213740 in words is "twelve billion, twenty-eight million, two hundred thirteen thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •