Base | Representation |
---|---|
bin | 110011010100100101… |
… | …0100100011001011111 |
3 | 101112110212220001120002 |
4 | 1212221022210121133 |
5 | 3301203322134211 |
6 | 122344132044515 |
7 | 10651110053660 |
oct | 1465112443137 |
9 | 345425801502 |
10 | 110212302431 |
11 | 42816a76070 |
12 | 19439a6373b |
13 | a5154a0a4a |
14 | 5497489367 |
15 | 2d00a8203b |
hex | 19a92a465f |
110212302431 has 16 divisors (see below), whose sum is σ = 137414810880. Its totient is φ = 85875175680.
The previous prime is 110212302377. The next prime is 110212302433. The reversal of 110212302431 is 134203212011.
It is not a de Polignac number, because 110212302431 - 218 = 110212040287 is a prime.
It is a super-2 number, since 2×1102123024312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110212302433) 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, 2846480 + ... + 2884938.
It is an arithmetic number, because the mean of its divisors is an integer number (8588425680).
Almost surely, 2110212302431 is an apocalyptic number.
110212302431 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110212302431 is a deficient number, since it is larger than the sum of its proper divisors (27202508449).
110212302431 is a wasteful number, since it uses less digits than its factorization.
110212302431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75694.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 110212302431 its reverse (134203212011), we get a palindrome (244415514442).
The spelling of 110212302431 in words is "one hundred ten billion, two hundred twelve million, three hundred two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •