Base | Representation |
---|---|
bin | 1001001010110011000100… |
… | …0010111111011011101001 |
3 | 1022200202002222002122010110 |
4 | 2102230301002333123221 |
5 | 2310132103421031101 |
6 | 33235110513404533 |
7 | 2060223221410611 |
oct | 222546102773351 |
9 | 38622088078113 |
10 | 10081111111401 |
11 | 3237414454590 |
12 | 1169953869749 |
13 | 58184c5316b5 |
14 | 26bcdd699a41 |
15 | 127375c3ecd6 |
hex | 92b310bf6e9 |
10081111111401 has 64 divisors (see below), whose sum is σ = 14870044717056. Its totient is φ = 6024205824000.
The previous prime is 10081111111387. The next prime is 10081111111447. The reversal of 10081111111401 is 10411111118001.
It is not a de Polignac number, because 10081111111401 - 225 = 10081077556969 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10081111111471) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2958939040 + ... + 2958942446.
It is an arithmetic number, because the mean of its divisors is an integer number (232344448704).
Almost surely, 210081111111401 is an apocalyptic number.
10081111111401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10081111111401 is a deficient number, since it is larger than the sum of its proper divisors (4788933605655).
10081111111401 is a wasteful number, since it uses less digits than its factorization.
10081111111401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6942.
The product of its (nonzero) digits is 32, while the sum is 21.
Adding to 10081111111401 its reverse (10411111118001), we get a palindrome (20492222229402).
The spelling of 10081111111401 in words is "ten trillion, eighty-one billion, one hundred eleven million, one hundred eleven thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •