Base | Representation |
---|---|
bin | 11001000101000101000100… |
… | …011010110101001110001001 |
3 | 112110112121002210110221100020 |
4 | 121011011010122311032021 |
5 | 103424124303432404001 |
6 | 1030331114100131053 |
7 | 32142632566155651 |
oct | 3105050432651611 |
9 | 473477083427306 |
10 | 110300203013001 |
11 | 32166065098131 |
12 | 10454b02996a89 |
13 | 49713591a08b1 |
14 | 1d347b600b361 |
15 | cb4264b23736 |
hex | 6451446b5389 |
110300203013001 has 8 divisors (see below), whose sum is σ = 147234630555264. Its totient is φ = 73449622073040.
The previous prime is 110300203012931. The next prime is 110300203013027. The reversal of 110300203013001 is 100310302003011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110300203013001 - 226 = 110300135904137 is a prime.
It is a super-2 number, since 2×1103002030130012 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110300203013101) 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, 20961647505 + ... + 20961652766.
It is an arithmetic number, because the mean of its divisors is an integer number (18404328819408).
Almost surely, 2110300203013001 is an apocalyptic number.
It is an amenable number.
110300203013001 is a deficient number, since it is larger than the sum of its proper divisors (36934427542263).
110300203013001 is an equidigital number, since it uses as much as digits as its factorization.
110300203013001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41923301151.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 110300203013001 its reverse (100310302003011), we get a palindrome (210610505016012).
The spelling of 110300203013001 in words is "one hundred ten trillion, three hundred billion, two hundred three million, thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •