Base | Representation |
---|---|
bin | 1000110010100010110… |
… | …00101010100111011111 |
3 | 1001212112210222200122002 |
4 | 10121101120222213133 |
5 | 14422010330144411 |
6 | 350424245312515 |
7 | 30551111154530 |
oct | 4312130524737 |
9 | 1055483880562 |
10 | 302013131231 |
11 | 1070a05a2619 |
12 | 4a64770573b |
13 | 22630c22b16 |
14 | 10890658687 |
15 | 7cc92b733b |
hex | 465162a9df |
302013131231 has 4 divisors (see below), whose sum is σ = 345157864272. Its totient is φ = 258868398192.
The previous prime is 302013131227. The next prime is 302013131249. The reversal of 302013131231 is 132131310203.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 132131310203 = 41 ⋅3222714883.
It is a cyclic number.
It is not a de Polignac number, because 302013131231 - 22 = 302013131227 is a prime.
It is a super-2 number, since 2×3020131312312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302013131281) 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, 21572366510 + ... + 21572366523.
It is an arithmetic number, because the mean of its divisors is an integer number (86289466068).
Almost surely, 2302013131231 is an apocalyptic number.
302013131231 is a deficient number, since it is larger than the sum of its proper divisors (43144733041).
302013131231 is an equidigital number, since it uses as much as digits as its factorization.
302013131231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 43144733040.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 302013131231 its reverse (132131310203), we get a palindrome (434144441434).
The spelling of 302013131231 in words is "three hundred two billion, thirteen million, one hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •