Base | Representation |
---|---|
bin | 1000101110110010111… |
… | …01000100110001101000 |
3 | 1001200100120211220100010 |
4 | 10113121131010301220 |
5 | 14403400230133112 |
6 | 345452451011520 |
7 | 30450206414166 |
oct | 4273135046150 |
9 | 1050316756303 |
10 | 300001021032 |
11 | 106258834429 |
12 | 4a185899ba0 |
13 | 223a00c857b |
14 | 1073d32a236 |
15 | 7c0c81163c |
hex | 45d9744c68 |
300001021032 has 16 divisors (see below), whose sum is σ = 750002552640. Its totient is φ = 100000340336.
The previous prime is 300001021031. The next prime is 300001021051. The reversal of 300001021032 is 230120100003.
It is a happy number.
It is a super-2 number, since 2×3000010210322 (a number of 24 digits) contains 22 as substring.
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 = 300001020999 and 300001021017.
It is not an unprimeable number, because it can be changed into a prime (300001021031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6250021248 + ... + 6250021295.
It is an arithmetic number, because the mean of its divisors is an integer number (46875159540).
Almost surely, 2300001021032 is an apocalyptic number.
It is an amenable number.
300001021032 is an abundant number, since it is smaller than the sum of its proper divisors (450001531608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300001021032 is a wasteful number, since it uses less digits than its factorization.
300001021032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12500042552 (or 12500042548 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 300001021032 its reverse (230120100003), we get a palindrome (530121121035).
The spelling of 300001021032 in words is "three hundred billion, one million, twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •