Base | Representation |
---|---|
bin | 1001010001110010111011… |
… | …1001011101100000110111 |
3 | 1100010020102111221102111122 |
4 | 2110130232321131200313 |
5 | 2314114313020034111 |
6 | 33410232254254155 |
7 | 2102010366334163 |
oct | 224345671354067 |
9 | 40106374842448 |
10 | 10201334143031 |
11 | 32833a81a2669 |
12 | 11891061b735b |
13 | 58cc9b9a8335 |
14 | 273a6649bca3 |
15 | 12a56059dcdb |
hex | 9472ee5d837 |
10201334143031 has 4 divisors (see below), whose sum is σ = 10269799473000. Its totient is φ = 10132868813064.
The previous prime is 10201334143003. The next prime is 10201334143073. The reversal of 10201334143031 is 13034143310201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10201334143031 - 234 = 10184154273847 is a prime.
It is a super-2 number, since 2×102013341430312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201334143831) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34232664761 + ... + 34232665058.
It is an arithmetic number, because the mean of its divisors is an integer number (2567449868250).
Almost surely, 210201334143031 is an apocalyptic number.
10201334143031 is a deficient number, since it is larger than the sum of its proper divisors (68465329969).
10201334143031 is an equidigital number, since it uses as much as digits as its factorization.
10201334143031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 68465329968.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 10201334143031 its reverse (13034143310201), we get a palindrome (23235477453232).
The spelling of 10201334143031 in words is "ten trillion, two hundred one billion, three hundred thirty-four million, one hundred forty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •