Base | Representation |
---|---|
bin | 1001000110101101111001… |
… | …0110000000100111100011 |
3 | 1022110001011002102000202022 |
4 | 2101223132112000213203 |
5 | 2303010014023030311 |
6 | 33142554121212055 |
7 | 2052162004632446 |
oct | 221533626004743 |
9 | 38401132360668 |
10 | 10011004111331 |
11 | 320a70891a803 |
12 | 115824903102b |
13 | 578058b922c2 |
14 | 26876c78d65d |
15 | 1256210455db |
hex | 91ade5809e3 |
10011004111331 has 8 divisors (see below), whose sum is σ = 10088384050944. Its totient is φ = 9933818839560.
The previous prime is 10011004111307. The next prime is 10011004111357. The reversal of 10011004111331 is 13311140011001.
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 10011004111331 - 234 = 9993824242147 is a prime.
It is a super-4 number, since 4×100110041113314 (a number of 53 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10011004161331) 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, 48563711 + ... + 48769416.
It is an arithmetic number, because the mean of its divisors is an integer number (1261048006368).
Almost surely, 210011004111331 is an apocalyptic number.
10011004111331 is a deficient number, since it is larger than the sum of its proper divisors (77379939613).
10011004111331 is an equidigital number, since it uses as much as digits as its factorization.
10011004111331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97333921.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 10011004111331 its reverse (13311140011001), we get a palindrome (23322144122332).
The spelling of 10011004111331 in words is "ten trillion, eleven billion, four million, one hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •