Base | Representation |
---|---|
bin | 10011000011101011… |
… | …11000101010111101 |
3 | 222102001021112020202 |
4 | 21201311320222331 |
5 | 131423222402201 |
6 | 4411131253245 |
7 | 511354615112 |
oct | 114165705275 |
9 | 28361245222 |
10 | 10231450301 |
11 | 4380429056 |
12 | 1b965aa225 |
13 | c70936907 |
14 | 6d0bb0909 |
15 | 3ed37ac6b |
hex | 261d78abd |
10231450301 has 2 divisors, whose sum is σ = 10231450302. Its totient is φ = 10231450300.
The previous prime is 10231450283. The next prime is 10231450309. The reversal of 10231450301 is 10305413201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7903387801 + 2328062500 = 88901^2 + 48250^2 .
It is an emirp because it is prime and its reverse (10305413201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10231450301 - 218 = 10231188157 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10231450309) 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, 5115725150 + 5115725151.
It is an arithmetic number, because the mean of its divisors is an integer number (5115725151).
Almost surely, 210231450301 is an apocalyptic number.
It is an amenable number.
10231450301 is a deficient number, since it is larger than the sum of its proper divisors (1).
10231450301 is an equidigital number, since it uses as much as digits as its factorization.
10231450301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 360, while the sum is 20.
Adding to 10231450301 its reverse (10305413201), we get a palindrome (20536863502).
The spelling of 10231450301 in words is "ten billion, two hundred thirty-one million, four hundred fifty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •