Base | Representation |
---|---|
bin | 10010111011101001101… |
… | …010010011000110101111 |
3 | 11121101002221121010000021 |
4 | 102323221222103012233 |
5 | 132303422034144043 |
6 | 2433400555343011 |
7 | 162665000053621 |
oct | 22735152230657 |
9 | 4541087533007 |
10 | 1301000303023 |
11 | 461829832703 |
12 | 190186451a67 |
13 | 958b740c515 |
14 | 46d7c374c11 |
15 | 23c96b663ed |
hex | 12ee9a931af |
1301000303023 has 4 divisors (see below), whose sum is σ = 1301003190088. Its totient is φ = 1300997415960.
The previous prime is 1301000302997. The next prime is 1301000303027. The reversal of 1301000303023 is 3203030001031.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1301000303023 - 25 = 1301000302991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1301000302988 and 1301000303006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1301000303027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 605361 + ... + 1722922.
It is an arithmetic number, because the mean of its divisors is an integer number (325250797522).
Almost surely, 21301000303023 is an apocalyptic number.
1301000303023 is a deficient number, since it is larger than the sum of its proper divisors (2887065).
1301000303023 is an equidigital number, since it uses as much as digits as its factorization.
1301000303023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2887064.
The product of its (nonzero) digits is 162, while the sum is 16.
Adding to 1301000303023 its reverse (3203030001031), we get a palindrome (4504030304054).
The spelling of 1301000303023 in words is "one trillion, three hundred one billion, three hundred three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •