Base | Representation |
---|---|
bin | 10011001111100100… |
… | …11101000101111001 |
3 | 222200000000001121000 |
4 | 21213302131011321 |
5 | 132124242323301 |
6 | 4425053435213 |
7 | 514005605010 |
oct | 114762350571 |
9 | 28600001530 |
10 | 10331214201 |
11 | 4421779160 |
12 | 2003a9bb09 |
13 | c884c6ac9 |
14 | 70013da77 |
15 | 406ed5786 |
hex | 267c9d179 |
10331214201 has 32 divisors (see below), whose sum is σ = 19082188800. Its totient is φ = 5366863440.
The previous prime is 10331214199. The next prime is 10331214203. The reversal of 10331214201 is 10241213301.
It is an interprime number because it is at equal distance from previous prime (10331214199) and next prime (10331214203).
It is not a de Polignac number, because 10331214201 - 21 = 10331214199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (10331214203) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2482581 + ... + 2486738.
It is an arithmetic number, because the mean of its divisors is an integer number (596318400).
Almost surely, 210331214201 is an apocalyptic number.
10331214201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10331214201 is a deficient number, since it is larger than the sum of its proper divisors (8750974599).
10331214201 is a wasteful number, since it uses less digits than its factorization.
10331214201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4969346 (or 4969340 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10331214201 its reverse (10241213301), we get a palindrome (20572427502).
The spelling of 10331214201 in words is "ten billion, three hundred thirty-one million, two hundred fourteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •