Base | Representation |
---|---|
bin | 1000110010101101010… |
… | …00010110101100100111 |
3 | 1001212202221120111021121 |
4 | 10121112220112230213 |
5 | 14422200342130043 |
6 | 350441111354411 |
7 | 30553230144010 |
oct | 4312650265447 |
9 | 1055687514247 |
10 | 302101130023 |
11 | 1071362373a0 |
12 | 4a671082a07 |
13 | 22646223c04 |
14 | 1089c204007 |
15 | 7cd1d9aded |
hex | 4656a16b27 |
302101130023 has 16 divisors (see below), whose sum is σ = 381413237760. Its totient is φ = 232423682400.
The previous prime is 302101130021. The next prime is 302101130081. The reversal of 302101130023 is 320031101203.
It is not a de Polignac number, because 302101130023 - 21 = 302101130021 is a prime.
It is a super-2 number, since 2×3021011300232 (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 = 302101129979 and 302101130006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302101130021) 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 15 ways as a sum of consecutive naturals, for example, 24825508 + ... + 24837673.
It is an arithmetic number, because the mean of its divisors is an integer number (23838327360).
Almost surely, 2302101130023 is an apocalyptic number.
302101130023 is a deficient number, since it is larger than the sum of its proper divisors (79312107737).
302101130023 is a wasteful number, since it uses less digits than its factorization.
302101130023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49663278.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 302101130023 its reverse (320031101203), we get a palindrome (622132231226).
The spelling of 302101130023 in words is "three hundred two billion, one hundred one million, one hundred thirty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •