Base | Representation |
---|---|
bin | 110011010111100111… |
… | …0101101111001101111 |
3 | 101112201222100112102020 |
4 | 1212233032231321233 |
5 | 3301410344200411 |
6 | 122402205001223 |
7 | 10653453660354 |
oct | 1465716557157 |
9 | 345658315366 |
10 | 110314053231 |
11 | 42869452a38 |
12 | 19467b53213 |
13 | a5305a8415 |
14 | 54a6bb462b |
15 | 2d09980606 |
hex | 19af3ade6f |
110314053231 has 8 divisors (see below), whose sum is σ = 147966155904. Its totient is φ = 73102326360.
The previous prime is 110314053229. The next prime is 110314053247. The reversal of 110314053231 is 132350413011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 110314053231 - 21 = 110314053229 is a prime.
It is a super-2 number, since 2×1103140532312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110314053281) 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, 110093365 + ... + 110094366.
It is an arithmetic number, because the mean of its divisors is an integer number (18495769488).
Almost surely, 2110314053231 is an apocalyptic number.
110314053231 is a deficient number, since it is larger than the sum of its proper divisors (37652102673).
110314053231 is a wasteful number, since it uses less digits than its factorization.
110314053231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220187901.
The product of its (nonzero) digits is 1080, while the sum is 24.
Adding to 110314053231 its reverse (132350413011), we get a palindrome (242664466242).
The spelling of 110314053231 in words is "one hundred ten billion, three hundred fourteen million, fifty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •