Base | Representation |
---|---|
bin | 100111010101101… |
… | …1100110101000011 |
3 | 10101222211121120221 |
4 | 1032223130311003 |
5 | 10200410404443 |
6 | 334552243511 |
7 | 44465632522 |
oct | 11653346503 |
9 | 3358747527 |
10 | 1320013123 |
11 | 618127440 |
12 | 30a0a0597 |
13 | 180624370 |
14 | c74504b9 |
15 | 7ad44eed |
hex | 4eadcd43 |
1320013123 has 16 divisors (see below), whose sum is σ = 1552475232. Its totient is φ = 1106496000.
The previous prime is 1320013063. The next prime is 1320013169. The reversal of 1320013123 is 3213100231.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1320013123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1320013097 and 1320013106.
It is not an unprimeable number, because it can be changed into a prime (1320013193) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 141483 + ... + 150523.
It is an arithmetic number, because the mean of its divisors is an integer number (97029702).
Almost surely, 21320013123 is an apocalyptic number.
1320013123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1320013123 is a deficient number, since it is larger than the sum of its proper divisors (232462109).
1320013123 is a wasteful number, since it uses less digits than its factorization.
1320013123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10086.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 1320013123 is about 36331.9848480647. The cubic root of 1320013123 is about 1096.9649456824.
Adding to 1320013123 its reverse (3213100231), we get a palindrome (4533113354).
The spelling of 1320013123 in words is "one billion, three hundred twenty million, thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •