Base | Representation |
---|---|
bin | 1001001101101100111011… |
… | …0010011001001111001001 |
3 | 1022212111212221222120210222 |
4 | 2103123032302121033021 |
5 | 2311441243030413113 |
6 | 33314041304515425 |
7 | 2063640451600460 |
oct | 223331662311711 |
9 | 38774787876728 |
10 | 10131002201033 |
11 | 325659669a66a |
12 | 117755817bb75 |
13 | 58647085accc |
14 | 2704b37599d7 |
15 | 1287e5c6ee08 |
hex | 936cec993c9 |
10131002201033 has 8 divisors (see below), whose sum is σ = 11578332055680. Its totient is φ = 8683683302880.
The previous prime is 10131002201029. The next prime is 10131002201069. The reversal of 10131002201033 is 33010220013101.
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 10131002201033 - 22 = 10131002201029 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10131002201833) 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, 651653 + ... + 4548258.
It is an arithmetic number, because the mean of its divisors is an integer number (1447291506960).
Almost surely, 210131002201033 is an apocalyptic number.
It is an amenable number.
10131002201033 is a deficient number, since it is larger than the sum of its proper divisors (1447329854647).
10131002201033 is an equidigital number, since it uses as much as digits as its factorization.
10131002201033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5478247.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 10131002201033 its reverse (33010220013101), we get a palindrome (43141222214134).
The spelling of 10131002201033 in words is "ten trillion, one hundred thirty-one billion, two million, two hundred one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •