Base | Representation |
---|---|
bin | 10011001111100101… |
… | …11001011010011001 |
3 | 222200000012221201022 |
4 | 21213302321122121 |
5 | 132124310031301 |
6 | 4425100132225 |
7 | 514006600133 |
oct | 114762713231 |
9 | 28600187638 |
10 | 10331330201 |
11 | 4421848325 |
12 | 2003b37075 |
13 | c8853784a |
14 | 700170053 |
15 | 407009d1b |
hex | 267cb9699 |
10331330201 has 2 divisors, whose sum is σ = 10331330202. Its totient is φ = 10331330200.
The previous prime is 10331330179. The next prime is 10331330293. The reversal of 10331330201 is 10203313301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9471960976 + 859369225 = 97324^2 + 29315^2 .
It is an emirp because it is prime and its reverse (10203313301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10331330201 - 26 = 10331330137 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 10331330201.
It is not a weakly prime, because it can be changed into another prime (10331332201) 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 as a sum of consecutive naturals, namely, 5165665100 + 5165665101.
It is an arithmetic number, because the mean of its divisors is an integer number (5165665101).
Almost surely, 210331330201 is an apocalyptic number.
It is an amenable number.
10331330201 is a deficient number, since it is larger than the sum of its proper divisors (1).
10331330201 is an equidigital number, since it uses as much as digits as its factorization.
10331330201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 17.
Adding to 10331330201 its reverse (10203313301), we get a palindrome (20534643502).
The spelling of 10331330201 in words is "ten billion, three hundred thirty-one million, three hundred thirty thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •