Base | Representation |
---|---|
bin | 10010101010110101… |
… | …10100110011110001 |
3 | 221212112002200100101 |
4 | 21111122310303301 |
5 | 131011343430001 |
6 | 4334324152401 |
7 | 503244230545 |
oct | 112532646361 |
9 | 27775080311 |
10 | 10023030001 |
11 | 4283814876 |
12 | 1b38838701 |
13 | c396c1aaa |
14 | 6b1239a25 |
15 | 3d9e0ba01 |
hex | 2556b4cf1 |
10023030001 has 2 divisors, whose sum is σ = 10023030002. Its totient is φ = 10023030000.
The previous prime is 10023029981. The next prime is 10023030041. The reversal of 10023030001 is 10003032001.
10023030001 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9996000400 + 27029601 = 99980^2 + 5199^2 .
It is a cyclic number.
It is not a de Polignac number, because 10023030001 - 27 = 10023029873 is a prime.
It is a super-2 number, since 2×100230300012 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10023030001.
It is not a weakly prime, because it can be changed into another prime (10023030041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011515000 + 5011515001.
It is an arithmetic number, because the mean of its divisors is an integer number (5011515001).
Almost surely, 210023030001 is an apocalyptic number.
It is an amenable number.
10023030001 is a deficient number, since it is larger than the sum of its proper divisors (1).
10023030001 is an equidigital number, since it uses as much as digits as its factorization.
10023030001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18, while the sum is 10.
Adding to 10023030001 its reverse (10003032001), we get a palindrome (20026062002).
The spelling of 10023030001 in words is "ten billion, twenty-three million, thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •