Base | Representation |
---|---|
bin | 10110101100001011… |
… | …11111110101110111 |
3 | 1011102222021010122002 |
4 | 23112011333311313 |
5 | 144422022043111 |
6 | 5332442525515 |
7 | 610606566236 |
oct | 132605776567 |
9 | 34388233562 |
10 | 12181831031 |
11 | 5191364a57 |
12 | 243b80689b |
13 | 11c1a29c56 |
14 | 837c30b1d |
15 | 4b46db63b |
hex | 2d617fd77 |
12181831031 has 8 divisors (see below), whose sum is σ = 12633332400. Its totient is φ = 11732425600.
The previous prime is 12181831009. The next prime is 12181831063. The reversal of 12181831031 is 13013818121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12181831031 - 210 = 12181830007 is a prime.
It is a super-2 number, since 2×121818310312 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12181830985 and 12181831003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12181831001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 512141 + ... + 535398.
It is an arithmetic number, because the mean of its divisors is an integer number (1579166550).
Almost surely, 212181831031 is an apocalyptic number.
12181831031 is a deficient number, since it is larger than the sum of its proper divisors (451501369).
12181831031 is a wasteful number, since it uses less digits than its factorization.
12181831031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047969.
The product of its (nonzero) digits is 1152, while the sum is 29.
The spelling of 12181831031 in words is "twelve billion, one hundred eighty-one million, eight hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •