Base | Representation |
---|---|
bin | 1000110010100100000… |
… | …10101010110111111011 |
3 | 1001212120120201010000121 |
4 | 10121102002222313323 |
5 | 14422021140023311 |
6 | 350425321314111 |
7 | 30551303565052 |
oct | 4312202526773 |
9 | 1055516633017 |
10 | 302024142331 |
11 | 1070a68333aa |
12 | 4a64b335937 |
13 | 226332a9972 |
14 | 10891cc3399 |
15 | 7cca23eb71 |
hex | 46520aadfb |
302024142331 has 4 divisors (see below), whose sum is σ = 304402285312. Its totient is φ = 299645999352.
The previous prime is 302024142283. The next prime is 302024142349. The reversal of 302024142331 is 133241420203.
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-302024142331 is a prime.
It is a super-2 number, since 2×3020241423312 (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 = 302024142296 and 302024142305.
It is not an unprimeable number, because it can be changed into a prime (302024142631) 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, 1189071300 + ... + 1189071553.
It is an arithmetic number, because the mean of its divisors is an integer number (76100571328).
Almost surely, 2302024142331 is an apocalyptic number.
302024142331 is a deficient number, since it is larger than the sum of its proper divisors (2378142981).
302024142331 is a wasteful number, since it uses less digits than its factorization.
302024142331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2378142980.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 302024142331 its reverse (133241420203), we get a palindrome (435265562534).
The spelling of 302024142331 in words is "three hundred two billion, twenty-four million, one hundred forty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •