Base | Representation |
---|---|
bin | 1000111000010110111… |
… | …10111101001001111000 |
3 | 1002011121101222102220101 |
4 | 10130023132331021320 |
5 | 14444404121422300 |
6 | 352102141205144 |
7 | 31021352420443 |
oct | 4341336751170 |
9 | 1064541872811 |
10 | 305135342200 |
11 | 108452a44967 |
12 | 4b1792607b4 |
13 | 22a0aa26730 |
14 | 10aa919465a |
15 | 7e0d44bb6a |
hex | 470b7bd278 |
305135342200 has 96 divisors (see below), whose sum is σ = 764285301360. Its totient is φ = 112625049600.
The previous prime is 305135342191. The next prime is 305135342203. The reversal of 305135342200 is 2243531503.
It is a super-2 number, since 2×3051353422002 (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 (305135342203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7809112 + ... + 7848088.
Almost surely, 2305135342200 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 305135342200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (382142650680).
305135342200 is an abundant number, since it is smaller than the sum of its proper divisors (459149959160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
305135342200 is a wasteful number, since it uses less digits than its factorization.
305135342200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42017 (or 42008 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 28.
Adding to 305135342200 its reverse (2243531503), we get a palindrome (307378873703).
The spelling of 305135342200 in words is "three hundred five billion, one hundred thirty-five million, three hundred forty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •