Base | Representation |
---|---|
bin | 10100011111011100… |
… | …10111001011001111 |
3 | 1001101200202101112010 |
4 | 22033232113023033 |
5 | 140012303330111 |
6 | 5015350312303 |
7 | 536422624641 |
oct | 121756271317 |
9 | 31350671463 |
10 | 11001230031 |
11 | 47359a8a50 |
12 | 2170358693 |
13 | 106426848c |
14 | 765110891 |
15 | 445c33aa6 |
hex | 28fb972cf |
11001230031 has 8 divisors (see below), whose sum is σ = 16001789184. Its totient is φ = 6667412120.
The previous prime is 11001230029. The next prime is 11001230039. The reversal of 11001230031 is 13003210011.
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 11001230031 - 21 = 11001230029 is a prime.
It is a super-2 number, since 2×110012300312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11001229989 and 11001230016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11001230039) 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, 166685271 + ... + 166685336.
It is an arithmetic number, because the mean of its divisors is an integer number (2000223648).
Almost surely, 211001230031 is an apocalyptic number.
11001230031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
11001230031 is a deficient number, since it is larger than the sum of its proper divisors (5000559153).
11001230031 is a wasteful number, since it uses less digits than its factorization.
11001230031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 333370621.
The product of its (nonzero) digits is 18, while the sum is 12.
Adding to 11001230031 its reverse (13003210011), we get a palindrome (24004440042).
The spelling of 11001230031 in words is "eleven billion, one million, two hundred thirty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •