Base | Representation |
---|---|
bin | 1000101110110011000… |
… | …00111000111101100100 |
3 | 1001200100122201201100010 |
4 | 10113121200320331210 |
5 | 14403401004134340 |
6 | 345452524250220 |
7 | 30450221051166 |
oct | 4273140707544 |
9 | 1050318651303 |
10 | 300002021220 |
11 | 106259357930 |
12 | 4a1860a0970 |
13 | 223a03888b5 |
14 | 1073d50a936 |
15 | 7c0c95cb80 |
hex | 45d9838f64 |
300002021220 has 96 divisors (see below), whose sum is σ = 956212024320. Its totient is φ = 69565682560.
The previous prime is 300002021219. The next prime is 300002021287. The reversal of 300002021220 is 22120200003.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 300002021196 and 300002021205.
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 31 ways as a sum of consecutive naturals, for example, 9866310 + ... + 9896669.
It is an arithmetic number, because the mean of its divisors is an integer number (9960541920).
Almost surely, 2300002021220 is an apocalyptic number.
300002021220 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
300002021220 is an abundant number, since it is smaller than the sum of its proper divisors (656210003100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300002021220 is a wasteful number, since it uses less digits than its factorization.
300002021220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19763025 (or 19763023 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
Adding to 300002021220 its reverse (22120200003), we get a palindrome (322122221223).
The spelling of 300002021220 in words is "three hundred billion, two million, twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •