Base | Representation |
---|---|
bin | 100010001111100001010010… |
… | …0001011100000000010000101 |
3 | 1110111110110102021112021102221 |
4 | 1010133002210023200002011 |
5 | 303434331023034341401 |
6 | 2544333245445532341 |
7 | 120304666155653215 |
oct | 10437024413400205 |
9 | 1414413367467387 |
10 | 301200221012101 |
11 | 87a76329540244 |
12 | 299467547140b1 |
13 | cc0b09c722ac8 |
14 | 5454250452245 |
15 | 24c4d97b547a1 |
hex | 111f0a42e0085 |
301200221012101 has 16 divisors (see below), whose sum is σ = 318554746481664. Its totient is φ = 284466974997744.
The previous prime is 301200221012087. The next prime is 301200221012149. The reversal of 301200221012101 is 101210122002103.
It is a cyclic number.
It is not a de Polignac number, because 301200221012101 - 217 = 301200220881029 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 (301200221012701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 897634911 + ... + 897970396.
It is an arithmetic number, because the mean of its divisors is an integer number (19909671655104).
Almost surely, 2301200221012101 is an apocalyptic number.
It is an amenable number.
301200221012101 is a deficient number, since it is larger than the sum of its proper divisors (17354525469563).
301200221012101 is a wasteful number, since it uses less digits than its factorization.
301200221012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1795605480.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 301200221012101 its reverse (101210122002103), we get a palindrome (402410343014204).
The spelling of 301200221012101 in words is "three hundred one trillion, two hundred billion, two hundred twenty-one million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •