Base | Representation |
---|---|
bin | 10011001101001011… |
… | …01111011110110000 |
3 | 222121121011101011202 |
4 | 21212211233132300 |
5 | 132104120320212 |
6 | 4423054430332 |
7 | 513342640646 |
oct | 114645573660 |
9 | 28547141152 |
10 | 10311104432 |
11 | 4411393412 |
12 | 1bb92023a8 |
13 | c842a5735 |
14 | 6db5c7196 |
15 | 4053620c2 |
hex | 26696f7b0 |
10311104432 has 80 divisors (see below), whose sum is σ = 21285137664. Its totient is φ = 4830720000.
The previous prime is 10311104431. The next prime is 10311104437. The reversal of 10311104432 is 23440111301.
It is a super-2 number, since 2×103111044322 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10311104431) 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, 2784182 + ... + 2787882.
Almost surely, 210311104432 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10311104432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (10642568832).
10311104432 is an abundant number, since it is smaller than the sum of its proper divisors (10974033232).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10311104432 is a wasteful number, since it uses less digits than its factorization.
10311104432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3918 (or 3912 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 10311104432 its reverse (23440111301), we get a palindrome (33751215733).
The spelling of 10311104432 in words is "ten billion, three hundred eleven million, one hundred four thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •