Base | Representation |
---|---|
bin | 111100111110100… |
… | …011001011111011 |
3 | 2122022000022100102 |
4 | 330332203023323 |
5 | 4043343430021 |
6 | 245303030015 |
7 | 34231416533 |
oct | 7476431373 |
9 | 2568008312 |
10 | 1023030011 |
11 | 485523653 |
12 | 24673b30b |
13 | 133c41803 |
14 | 99c244c3 |
15 | 5ec3000b |
hex | 3cfa32fb |
1023030011 has 4 divisors (see below), whose sum is σ = 1023102192. Its totient is φ = 1022957832.
The previous prime is 1023030007. The next prime is 1023030017. The reversal of 1023030011 is 1100303201.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length, and also an emirpimes, since its reverse is a distinct semiprime: 1100303201 = 947 ⋅1161883.
It is a cyclic number.
It is not a de Polignac number, because 1023030011 - 22 = 1023030007 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1023029974 and 1023030001.
It is not an unprimeable number, because it can be changed into a prime (1023030017) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7031 + ... + 45776.
It is an arithmetic number, because the mean of its divisors is an integer number (255775548).
Almost surely, 21023030011 is an apocalyptic number.
1023030011 is a deficient number, since it is larger than the sum of its proper divisors (72181).
1023030011 is an equidigital number, since it uses as much as digits as its factorization.
1023030011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 72180.
The product of its (nonzero) digits is 18, while the sum is 11.
The square root of 1023030011 is about 31984.8403310068. The cubic root of 1023030011 is about 1007.6184816749.
Adding to 1023030011 its reverse (1100303201), we get a palindrome (2123333212).
The spelling of 1023030011 in words is "one billion, twenty-three million, thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •