Base | Representation |
---|---|
bin | 1000101111000001010… |
… | …10100111111000100110 |
3 | 1001200200000111221102100 |
4 | 10113200222213320212 |
5 | 14404122213410342 |
6 | 345512452152530 |
7 | 30453206010123 |
oct | 4274052477046 |
9 | 1050600457370 |
10 | 300122013222 |
11 | 106310063679 |
12 | 4a1ba308746 |
13 | 223bc1abc95 |
14 | 1075142374a |
15 | 7c18260e4c |
hex | 45e0aa7e26 |
300122013222 has 48 divisors (see below), whose sum is σ = 651437055360. Its totient is φ = 99860428800.
The previous prime is 300122013221. The next prime is 300122013251. The reversal of 300122013222 is 222310221003.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 300122013195 and 300122013204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300122013221) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 25127772 + ... + 25139712.
It is an arithmetic number, because the mean of its divisors is an integer number (13571605320).
Almost surely, 2300122013222 is an apocalyptic number.
300122013222 is an abundant number, since it is smaller than the sum of its proper divisors (351315042138).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
300122013222 is a wasteful number, since it uses less digits than its factorization.
300122013222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14349 (or 14346 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 18.
Adding to 300122013222 its reverse (222310221003), we get a palindrome (522432234225).
The spelling of 300122013222 in words is "three hundred billion, one hundred twenty-two million, thirteen thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •