Base | Representation |
---|---|
bin | 10010110101011110… |
… | …00100011111111111 |
3 | 222002201221011110100 |
4 | 21122233010133333 |
5 | 131202212120411 |
6 | 4351232012143 |
7 | 505406323245 |
oct | 113257043777 |
9 | 28081834410 |
10 | 10112223231 |
11 | 431a0a4a90 |
12 | 1b62691053 |
13 | c52020756 |
14 | 6bd016795 |
15 | 3e2b79456 |
hex | 25abc47ff |
10112223231 has 48 divisors (see below), whose sum is σ = 16352088480. Its totient is φ = 5968512000.
The previous prime is 10112223197. The next prime is 10112223241. The reversal of 10112223231 is 13232221101.
10112223231 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 10112223231 - 213 = 10112215039 is a prime.
It is a super-2 number, since 2×101122232312 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10112223241) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2681115 + ... + 2684883.
It is an arithmetic number, because the mean of its divisors is an integer number (340668510).
Almost surely, 210112223231 is an apocalyptic number.
10112223231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10112223231 is a deficient number, since it is larger than the sum of its proper divisors (6239865249).
10112223231 is a wasteful number, since it uses less digits than its factorization.
10112223231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4488 (or 4485 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10112223231 its reverse (13232221101), we get a palindrome (23344444332).
The spelling of 10112223231 in words is "ten billion, one hundred twelve million, two hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •