Base | Representation |
---|---|
bin | 11001000001000001000100… |
… | …101001100011111010000001 |
3 | 112102112220112000201200201011 |
4 | 121001001010221203322001 |
5 | 103410041034201000001 |
6 | 1025554544255240521 |
7 | 32113520533542655 |
oct | 3101010451437201 |
9 | 472486460650634 |
10 | 110021034000001 |
11 | 320687274a5773 |
12 | 1040a991819141 |
13 | 4950c28c5bac7 |
14 | 1d250916a4a65 |
15 | cabd76128d51 |
hex | 641044a63e81 |
110021034000001 has 8 divisors (see below), whose sum is σ = 110188689091200. Its totient is φ = 109853394079728.
The previous prime is 110021033999959. The next prime is 110021034000029. The reversal of 110021034000001 is 100000430120011.
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 110021034000001 - 237 = 109883595046529 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110021034000071) 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 7 ways as a sum of consecutive naturals, for example, 10765050 + ... + 18328348.
It is an arithmetic number, because the mean of its divisors is an integer number (13773586136400).
Almost surely, 2110021034000001 is an apocalyptic number.
It is an amenable number.
110021034000001 is a deficient number, since it is larger than the sum of its proper divisors (167655091199).
110021034000001 is an equidigital number, since it uses as much as digits as its factorization.
110021034000001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7585463.
The product of its (nonzero) digits is 24, while the sum is 13.
Adding to 110021034000001 its reverse (100000430120011), we get a palindrome (210021464120012).
The spelling of 110021034000001 in words is "one hundred ten trillion, twenty-one billion, thirty-four million, one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •