Base | Representation |
---|---|
bin | 100010010101011011010110… |
… | …1111110100011101110001001 |
3 | 1110121100002002220110012021201 |
4 | 1010222312231332203232021 |
5 | 304041131322324213231 |
6 | 2550154243055304201 |
7 | 120420441141200014 |
oct | 10452665576435611 |
9 | 1417302086405251 |
10 | 302012134210441 |
11 | 8825969935a1a6 |
12 | 29a57b8481b061 |
13 | cc69811861a65 |
14 | 5481672a7c37b |
15 | 24db066c6d161 |
hex | 112adadfa3b89 |
302012134210441 has 16 divisors (see below), whose sum is σ = 305444508082560. Its totient is φ = 298597426882560.
The previous prime is 302012134210411. The next prime is 302012134210447. The reversal of 302012134210441 is 144012431210203.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 302012134210441 - 225 = 302012100656009 is a prime.
It is a super-2 number, since 2×3020121342104412 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (302012134210447) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 131784265 + ... + 134056393.
It is an arithmetic number, because the mean of its divisors is an integer number (19090281755160).
Almost surely, 2302012134210441 is an apocalyptic number.
It is an amenable number.
302012134210441 is a deficient number, since it is larger than the sum of its proper divisors (3432373872119).
302012134210441 is a wasteful number, since it uses less digits than its factorization.
302012134210441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2276016.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 302012134210441 its reverse (144012431210203), we get a palindrome (446024565420644).
The spelling of 302012134210441 in words is "three hundred two trillion, twelve billion, one hundred thirty-four million, two hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •