Base | Representation |
---|---|
bin | 1000110010101110100… |
… | …10101010111100110111 |
3 | 1001212210201110002000202 |
4 | 10121113102222330313 |
5 | 14422211212114111 |
6 | 350442145231115 |
7 | 30553423345103 |
oct | 4312722527467 |
9 | 1055721402022 |
10 | 302112223031 |
11 | 107141523773 |
12 | 4a67493249b |
13 | 22648609118 |
14 | 1089d890903 |
15 | 7cd2d3cb3b |
hex | 46574aaf37 |
302112223031 has 4 divisors (see below), whose sum is σ = 303179757672. Its totient is φ = 301044688392.
The previous prime is 302112223009. The next prime is 302112223057. The reversal of 302112223031 is 130322211203.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-302112223031 is a prime.
It is a super-2 number, since 2×3021122230312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 302112222994 and 302112223012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302112220031) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 533766896 + ... + 533767461.
It is an arithmetic number, because the mean of its divisors is an integer number (75794939418).
Almost surely, 2302112223031 is an apocalyptic number.
302112223031 is a deficient number, since it is larger than the sum of its proper divisors (1067534641).
302112223031 is a wasteful number, since it uses less digits than its factorization.
302112223031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1067534640.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 302112223031 its reverse (130322211203), we get a palindrome (432434434234).
The spelling of 302112223031 in words is "three hundred two billion, one hundred twelve million, two hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •