Base | Representation |
---|---|
bin | 101011110101011011001… |
… | …001100010111000000101 |
3 | 101122222021110100020020002 |
4 | 223311123021202320011 |
5 | 343323143113201201 |
6 | 10223455423051045 |
7 | 430426430416103 |
oct | 53653311427005 |
9 | 11588243306202 |
10 | 3012301303301 |
11 | a61567611a44 |
12 | 407979740a85 |
13 | 18b09c22a7b4 |
14 | a5b20946c73 |
15 | 5355467e76b |
hex | 2bd5b262e05 |
3012301303301 has 8 divisors (see below), whose sum is σ = 3021661644480. Its totient is φ = 3002944867168.
The previous prime is 3012301303289. The next prime is 3012301303331. The reversal of 3012301303301 is 1033031032103.
3012301303301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3012301303301 - 218 = 3012301041157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3012301303331) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 572720 + ... + 2520438.
It is an arithmetic number, because the mean of its divisors is an integer number (377707705560).
Almost surely, 23012301303301 is an apocalyptic number.
It is an amenable number.
3012301303301 is a deficient number, since it is larger than the sum of its proper divisors (9360341179).
3012301303301 is a wasteful number, since it uses less digits than its factorization.
3012301303301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1952523.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 3012301303301 its reverse (1033031032103), we get a palindrome (4045332335404).
The spelling of 3012301303301 in words is "three trillion, twelve billion, three hundred one million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •