Base | Representation |
---|---|
bin | 1000101110110100010… |
… | …00001110010110000110 |
3 | 1001200101101010120122111 |
4 | 10113122020032112012 |
5 | 14403411124114142 |
6 | 345453533251234 |
7 | 30450404515045 |
oct | 4273210162606 |
9 | 1050341116574 |
10 | 300012332422 |
11 | 10626415a890 |
12 | 4a189633b1a |
13 | 223a2558cba |
14 | 10740a3255c |
15 | 7c0d7e7e17 |
hex | 45da20e586 |
300012332422 has 8 divisors (see below), whose sum is σ = 490929271272. Its totient is φ = 136369242000.
The previous prime is 300012332407. The next prime is 300012332461. The reversal of 300012332422 is 224233210003.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 13636924201 = 300012332422 / (3 + 0 + 0 + 0 + 1 + 2 + 3 + 3 + 2 + 4 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 300012332393 and 300012332402.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 6818462079 + ... + 6818462122.
It is an arithmetic number, because the mean of its divisors is an integer number (61366158909).
Almost surely, 2300012332422 is an apocalyptic number.
300012332422 is a deficient number, since it is larger than the sum of its proper divisors (190916938850).
300012332422 is a wasteful number, since it uses less digits than its factorization.
300012332422 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13636924214.
The product of its (nonzero) digits is 1728, while the sum is 22.
Adding to 300012332422 its reverse (224233210003), we get a palindrome (524245542425).
The spelling of 300012332422 in words is "three hundred billion, twelve million, three hundred thirty-two thousand, four hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •