Base | Representation |
---|---|
bin | 1000101110110100001… |
… | …11110111110011100110 |
3 | 1001200101100221220000020 |
4 | 10113122013313303212 |
5 | 14403411113140402 |
6 | 345453531300010 |
7 | 30450403651641 |
oct | 4273207676346 |
9 | 1050340856006 |
10 | 300012240102 |
11 | 1062640a7493 |
12 | 4a1895aa606 |
13 | 223a2525c83 |
14 | 10740a0aa58 |
15 | 7c0d7ca8bc |
hex | 45da1f7ce6 |
300012240102 has 8 divisors (see below), whose sum is σ = 600024480216. Its totient is φ = 100004080032.
The previous prime is 300012240091. The next prime is 300012240109. The reversal of 300012240102 is 201042210003.
It is a sphenic number, since it is the product of 3 distinct primes.
300012240102 is an admirable number.
It is a super-2 number, since 2×3000122401022 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300012240109) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 25001020003 + ... + 25001020014.
It is an arithmetic number, because the mean of its divisors is an integer number (75003060027).
Almost surely, 2300012240102 is an apocalyptic number.
300012240102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300012240102 is a wasteful number, since it uses less digits than its factorization.
300012240102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50002040022.
The product of its (nonzero) digits is 96, while the sum is 15.
Adding to 300012240102 its reverse (201042210003), we get a palindrome (501054450105).
The spelling of 300012240102 in words is "three hundred billion, twelve million, two hundred forty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •