Base | Representation |
---|---|
bin | 1000110000101100011… |
… | …00001011010000101001 |
3 | 1001202222121020110111211 |
4 | 10120112030023100221 |
5 | 14412442110020241 |
6 | 350141531153121 |
7 | 30514361536204 |
oct | 4302614132051 |
9 | 1052877213454 |
10 | 301020001321 |
11 | 106730a413a6 |
12 | 4a40aba57a1 |
13 | 2250324c9a0 |
14 | 107d87b893b |
15 | 7c6bee1781 |
hex | 461630b429 |
301020001321 has 16 divisors (see below), whose sum is σ = 334649943936. Its totient is φ = 269000798976.
The previous prime is 301020001309. The next prime is 301020001333. The reversal of 301020001321 is 123100020103.
It is an interprime number because it is at equal distance from previous prime (301020001309) and next prime (301020001333).
It is not a de Polignac number, because 301020001321 - 27 = 301020001193 is a prime.
It is a super-2 number, since 2×3010200013212 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (301020001361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2319565 + ... + 2445898.
It is an arithmetic number, because the mean of its divisors is an integer number (20915621496).
Almost surely, 2301020001321 is an apocalyptic number.
It is an amenable number.
301020001321 is a deficient number, since it is larger than the sum of its proper divisors (33629942615).
301020001321 is a wasteful number, since it uses less digits than its factorization.
301020001321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4765632.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 301020001321 its reverse (123100020103), we get a palindrome (424120021424).
The spelling of 301020001321 in words is "three hundred one billion, twenty million, one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •