Base | Representation |
---|---|
bin | 11101011001100001000… |
… | …00110110011010011101 |
3 | 10120120022210010100122011 |
4 | 32230300200312122131 |
5 | 113022222043414123 |
6 | 2052014201551221 |
7 | 132656664543532 |
oct | 16546040663235 |
9 | 3516283110564 |
10 | 1010131232413 |
11 | 35a437823846 |
12 | 14392aaa5511 |
13 | 74341213714 |
14 | 36c67baad89 |
15 | 1b420de7e0d |
hex | eb3083669d |
1010131232413 has 8 divisors (see below), whose sum is σ = 1012345920000. Its totient is φ = 1007917307328.
The previous prime is 1010131232401. The next prime is 1010131232423. The reversal of 1010131232413 is 3142321310101.
1010131232413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1010131232413 - 221 = 1010129135261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1010131232423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2503428 + ... + 2878786.
It is an arithmetic number, because the mean of its divisors is an integer number (126543240000).
Almost surely, 21010131232413 is an apocalyptic number.
It is an amenable number.
1010131232413 is a deficient number, since it is larger than the sum of its proper divisors (2214687587).
1010131232413 is an equidigital number, since it uses as much as digits as its factorization.
1010131232413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 381251.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 1010131232413 its reverse (3142321310101), we get a palindrome (4152452542514).
The spelling of 1010131232413 in words is "one trillion, ten billion, one hundred thirty-one million, two hundred thirty-two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •