Base | Representation |
---|---|
bin | 100001011101111… |
… | …1101000110001001 |
3 | 2220021010222020010 |
4 | 1002323331012021 |
5 | 4244442404001 |
6 | 303234022133 |
7 | 36554311245 |
oct | 10273750611 |
9 | 2807128203 |
10 | 1123013001 |
11 | 526a03320 |
12 | 274117949 |
13 | 14b87a646 |
14 | a920d425 |
15 | 688ce8d6 |
hex | 42efd189 |
1123013001 has 16 divisors (see below), whose sum is σ = 1673316288. Its totient is φ = 664012800.
The previous prime is 1123012999. The next prime is 1123013009. The reversal of 1123013001 is 1003103211.
1123013001 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1123013001 - 21 = 1123012999 is a prime.
It is a super-2 number, since 2×11230130012 = 2522316400830052002, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1123013009) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 413656 + ... + 416361.
It is an arithmetic number, because the mean of its divisors is an integer number (104582268).
Almost surely, 21123013001 is an apocalyptic number.
1123013001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1123013001 is a deficient number, since it is larger than the sum of its proper divisors (550303287).
1123013001 is a wasteful number, since it uses less digits than its factorization.
1123013001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 830072.
The product of its (nonzero) digits is 18, while the sum is 12.
The square root of 1123013001 is about 33511.3861396392. The cubic root of 1123013001 is about 1039.4292359401.
Adding to 1123013001 its reverse (1003103211), we get a palindrome (2126116212).
The spelling of 1123013001 in words is "one billion, one hundred twenty-three million, thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •