Base | Representation |
---|---|
bin | 110011010101001101… |
… | …0011001111010011000 |
3 | 101112112100021100011021 |
4 | 1212222122121322120 |
5 | 3301224201343000 |
6 | 122350200412224 |
7 | 10651453001134 |
oct | 1465232317230 |
9 | 345470240137 |
10 | 110233231000 |
11 | 42827870002 |
12 | 19444a77074 |
13 | a51991aa09 |
14 | 549a1763c4 |
15 | 2d0281811a |
hex | 19aa699e98 |
110233231000 has 64 divisors (see below), whose sum is σ = 271521900000. Its totient is φ = 41772585600.
The previous prime is 110233230977. The next prime is 110233231001. The reversal of 110233231000 is 132332011.
It is a super-4 number, since 4×1102332310004 (a number of 45 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110233231001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2881875 + ... + 2919874.
Almost surely, 2110233231000 is an apocalyptic number.
110233231000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110233231000 is an abundant number, since it is smaller than the sum of its proper divisors (161288669000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110233231000 is a wasteful number, since it uses less digits than its factorization.
110233231000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5801789 (or 5801775 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 110233231000 its reverse (132332011), we get a palindrome (110365563011).
The spelling of 110233231000 in words is "one hundred ten billion, two hundred thirty-three million, two hundred thirty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •