Base | Representation |
---|---|
bin | 11101011101100111010… |
… | …01001000110010100011 |
3 | 10120210000002210022102202 |
4 | 32232303221020302203 |
5 | 113041223243021011 |
6 | 2053020351203415 |
7 | 133065340252100 |
oct | 16566351106243 |
9 | 3523002708382 |
10 | 1012331220131 |
11 | 360366645110 |
12 | 14424381656b |
13 | 74601c3c5ba |
14 | 36dd6043aa7 |
15 | 1b4ee11123b |
hex | ebb3a48ca3 |
1012331220131 has 24 divisors (see below), whose sum is σ = 1284759303984. Its totient is φ = 788771753280.
The previous prime is 1012331220097. The next prime is 1012331220133. The reversal of 1012331220131 is 1310221332101.
It is a happy number.
It is not a de Polignac number, because 1012331220131 - 218 = 1012330957987 is a prime.
It is a super-2 number, since 2×10123312201312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012331220133) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8224961 + ... + 8347133.
It is an arithmetic number, because the mean of its divisors is an integer number (53531637666).
Almost surely, 21012331220131 is an apocalyptic number.
1012331220131 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1012331220131 is a deficient number, since it is larger than the sum of its proper divisors (272428083853).
1012331220131 is a wasteful number, since it uses less digits than its factorization.
1012331220131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137571 (or 137564 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1012331220131 its reverse (1310221332101), we get a palindrome (2322552552232).
The spelling of 1012331220131 in words is "one trillion, twelve billion, three hundred thirty-one million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •