Base | Representation |
---|---|
bin | 10010110111101111… |
… | …00000011111001000 |
3 | 222011001122220110200 |
4 | 21123313200133020 |
5 | 131222042242412 |
6 | 4353151012200 |
7 | 506026611621 |
oct | 113367403710 |
9 | 28131586420 |
10 | 10131212232 |
11 | 4329894779 |
12 | 1b68b0a060 |
13 | c55c3b94b |
14 | 6c175aa48 |
15 | 3e467a9dc |
hex | 25bde07c8 |
10131212232 has 48 divisors (see below), whose sum is σ = 27710389980. Its totient is φ = 3343632000.
The previous prime is 10131212213. The next prime is 10131212233. The reversal of 10131212232 is 23221213101.
It can be written as a sum of positive squares in 2 ways, for example, as 8647884036 + 1483328196 = 92994^2 + 38514^2 .
It is a super-2 number, since 2×101312122322 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (10131212233) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 689319 + ... + 703862.
Almost surely, 210131212232 is an apocalyptic number.
10131212232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10131212232 is an abundant number, since it is smaller than the sum of its proper divisors (17579177748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10131212232 is a wasteful number, since it uses less digits than its factorization.
10131212232 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1393294 (or 1393287 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10131212232 its reverse (23221213101), we get a palindrome (33352425333).
The spelling of 10131212232 in words is "ten billion, one hundred thirty-one million, two hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •