Base | Representation |
---|---|
bin | 11110000010011101011… |
… | …11110101000111001001 |
3 | 10122200001202021201012102 |
4 | 33001032233311013021 |
5 | 113402232001442301 |
6 | 2110051334123145 |
7 | 134365505254646 |
oct | 17011657650711 |
9 | 3580052251172 |
10 | 1032113312201 |
11 | 36879806a734 |
12 | 1480447b04b5 |
13 | 7643542cb1a |
14 | 37d51404dcd |
15 | 1bcaab86b6b |
hex | f04ebf51c9 |
1032113312201 has 8 divisors (see below), whose sum is σ = 1044579098304. Its totient is φ = 1019648256880.
The previous prime is 1032113312189. The next prime is 1032113312213. The reversal of 1032113312201 is 1022133112301.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1032113312189) and next prime (1032113312213).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1032113312201 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1032113312281) 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, 2989595 + ... + 3316911.
It is an arithmetic number, because the mean of its divisors is an integer number (130572387288).
Almost surely, 21032113312201 is an apocalyptic number.
It is an amenable number.
1032113312201 is a deficient number, since it is larger than the sum of its proper divisors (12465786103).
1032113312201 is an equidigital number, since it uses as much as digits as its factorization.
1032113312201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 365391.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1032113312201 its reverse (1022133112301), we get a palindrome (2054246424502).
The spelling of 1032113312201 in words is "one trillion, thirty-two billion, one hundred thirteen million, three hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •