Base | Representation |
---|---|
bin | 100001011111010000110… |
… | …001000010110101001110 |
3 | 22011000002020210211121100 |
4 | 201133100301002311032 |
5 | 300201040331132232 |
6 | 4521112432243530 |
7 | 325156415265432 |
oct | 41372061026516 |
9 | 8130066724540 |
10 | 2301310020942 |
11 | 807a8656a219 |
12 | 3120140a05a6 |
13 | 1390218c91aa |
14 | 7d5539a09c2 |
15 | 3ece06aac7c |
hex | 217d0c42d4e |
2301310020942 has 24 divisors (see below), whose sum is σ = 5025432911616. Its totient is φ = 761063155776.
The previous prime is 2301310020941. The next prime is 2301310020949. The reversal of 2301310020942 is 2490200131032.
It is a happy number.
2301310020942 is a `hidden beast` number, since 2 + 301 + 310 + 0 + 2 + 0 + 9 + 42 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2301310020941) 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 11 ways as a sum of consecutive naturals, for example, 503346363 + ... + 503350934.
It is an arithmetic number, because the mean of its divisors is an integer number (209393037984).
Almost surely, 22301310020942 is an apocalyptic number.
2301310020942 is an abundant number, since it is smaller than the sum of its proper divisors (2724122890674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2301310020942 is a wasteful number, since it uses less digits than its factorization.
2301310020942 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1006697432 (or 1006697429 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
Adding to 2301310020942 its reverse (2490200131032), we get a palindrome (4791510151974).
The spelling of 2301310020942 in words is "two trillion, three hundred one billion, three hundred ten million, twenty thousand, nine hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •