Base | Representation |
---|---|
bin | 10010110111101110… |
… | …01100111010000000 |
3 | 222011001111211110022 |
4 | 21123313030322000 |
5 | 131222032211112 |
6 | 4353145153012 |
7 | 506026126040 |
oct | 113367147200 |
9 | 28131454408 |
10 | 10131132032 |
11 | 432983a49a |
12 | 1b68a8b768 |
13 | c55c112a8 |
14 | 6c1739720 |
15 | 3e4661d72 |
hex | 25bdcce80 |
10131132032 has 32 divisors (see below), whose sum is σ = 23066418720. Its totient is φ = 4341913344.
The previous prime is 10131132029. The next prime is 10131132043. The reversal of 10131132032 is 23023113101.
10131132032 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (32).
It is a self number, because there is not a number n which added to its sum of digits gives 10131132032.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5652638 + ... + 5654429.
It is an arithmetic number, because the mean of its divisors is an integer number (720825585).
Almost surely, 210131132032 is an apocalyptic number.
It is an amenable number.
10131132032 is an abundant number, since it is smaller than the sum of its proper divisors (12935286688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131132032 is an equidigital number, since it uses as much as digits as its factorization.
10131132032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11307088 (or 11307076 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10131132032 its reverse (23023113101), we get a palindrome (33154245133).
The spelling of 10131132032 in words is "ten billion, one hundred thirty-one million, one hundred thirty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •