Base | Representation |
---|---|
bin | 1001001100011110101110… |
… | …0111101111001001110001 |
3 | 1022210111201001112200020222 |
4 | 2103013223213233021301 |
5 | 2311120300321010001 |
6 | 33300250332542425 |
7 | 2062265333346365 |
oct | 223075347571161 |
9 | 38714631480228 |
10 | 10110011110001 |
11 | 32486a4782250 |
12 | 117347a321a15 |
13 | 5844a6a4529a |
14 | 26d4819a52a5 |
15 | 127eb7ed261b |
hex | 931eb9ef271 |
10110011110001 has 32 divisors (see below), whose sum is σ = 11163436851456. Its totient is φ = 9079408800000.
The previous prime is 10110011109973. The next prime is 10110011110027. The reversal of 10110011110001 is 10001111001101.
It is not a de Polignac number, because 10110011110001 - 26 = 10110011109937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10110011310001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1021105151 + ... + 1021115051.
It is an arithmetic number, because the mean of its divisors is an integer number (348857401608).
Almost surely, 210110011110001 is an apocalyptic number.
10110011110001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10110011110001 is a deficient number, since it is larger than the sum of its proper divisors (1053425741455).
10110011110001 is a wasteful number, since it uses less digits than its factorization.
10110011110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11993.
The product of its (nonzero) digits is 1, while the sum is 8.
Adding to 10110011110001 its reverse (10001111001101), we get a palindrome (20111122111102).
It can be divided in two parts, 10 and 110011110001, that added together give a palindrome (110011110011).
The spelling of 10110011110001 in words is "ten trillion, one hundred ten billion, eleven million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •