Base | Representation |
---|---|
bin | 110011001110010000… |
… | …1111101100111011111 |
3 | 101111221010000210201220 |
4 | 1212130201331213133 |
5 | 3300240041044411 |
6 | 122311120504423 |
7 | 10642624250100 |
oct | 1463441754737 |
9 | 344833023656 |
10 | 110000331231 |
11 | 42718356a5a |
12 | 1939aa7b113 |
13 | a4b05b48bb |
14 | 547726c3a7 |
15 | 2cdc160b06 |
hex | 199c87d9df |
110000331231 has 48 divisors (see below), whose sum is σ = 178346707200. Its totient is φ = 60017688192.
The previous prime is 110000331229. The next prime is 110000331247. The reversal of 110000331231 is 132133000011.
It is not a de Polignac number, because 110000331231 - 21 = 110000331229 is a prime.
It is a super-2 number, since 2×1100003312312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110000331231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110000331271) 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 47 ways as a sum of consecutive naturals, for example, 1895200 + ... + 1952378.
It is an arithmetic number, because the mean of its divisors is an integer number (3715556400).
Almost surely, 2110000331231 is an apocalyptic number.
110000331231 is a deficient number, since it is larger than the sum of its proper divisors (68346375969).
110000331231 is a wasteful number, since it uses less digits than its factorization.
110000331231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 57788 (or 57781 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 110000331231 its reverse (132133000011), we get a palindrome (242133331242).
The spelling of 110000331231 in words is "one hundred ten billion, three hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •