Base | Representation |
---|---|
bin | 1000110010111001000… |
… | …01100001000111110101 |
3 | 1001220000211121122210010 |
4 | 10121130201201013311 |
5 | 14422401200013023 |
6 | 350455002450433 |
7 | 30555540424431 |
oct | 4313441410765 |
9 | 1056024548703 |
10 | 302200001013 |
11 | 107187027659 |
12 | 4a69a203a19 |
13 | 22660860861 |
14 | 108ab3bd9c1 |
15 | 7cda8cb093 |
hex | 465c8611f5 |
302200001013 has 8 divisors (see below), whose sum is σ = 403337484448. Its totient is φ = 201264592464.
The previous prime is 302200000987. The next prime is 302200001029. The reversal of 302200001013 is 310100002203.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 302200001013 - 210 = 302199999989 is a prime.
It is a super-2 number, since 2×3022000010132 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 302200001013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302200001413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50515231 + ... + 50521212.
It is an arithmetic number, because the mean of its divisors is an integer number (50417185556).
Almost surely, 2302200001013 is an apocalyptic number.
It is an amenable number.
302200001013 is a deficient number, since it is larger than the sum of its proper divisors (101137483435).
302200001013 is a wasteful number, since it uses less digits than its factorization.
302200001013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101037443.
The product of its (nonzero) digits is 36, while the sum is 12.
Adding to 302200001013 its reverse (310100002203), we get a palindrome (612300003216).
The spelling of 302200001013 in words is "three hundred two billion, two hundred million, one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •