Base | Representation |
---|---|
bin | 100111010101101… |
… | …1101000111011011 |
3 | 10101222211200012111 |
4 | 1032223131013123 |
5 | 10200410424144 |
6 | 334552253151 |
7 | 44465636122 |
oct | 11653350733 |
9 | 3358750174 |
10 | 1320014299 |
11 | 61812830a |
12 | 30a0a11b7 |
13 | 180624a66 |
14 | c7450ab9 |
15 | 7ad45534 |
hex | 4eadd1db |
1320014299 has 4 divisors (see below), whose sum is σ = 1320344200. Its totient is φ = 1319684400.
The previous prime is 1320014287. The next prime is 1320014327. The reversal of 1320014299 is 9924100231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1320014299 - 227 = 1185796571 is a prime.
It is a super-2 number, since 2×13200142992 = 3484875499128922802, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1320014299.
It is not an unprimeable number, because it can be changed into a prime (1320014209) 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 in 3 ways as a sum of consecutive naturals, for example, 158874 + ... + 166975.
It is an arithmetic number, because the mean of its divisors is an integer number (330086050).
Almost surely, 21320014299 is an apocalyptic number.
1320014299 is a deficient number, since it is larger than the sum of its proper divisors (329901).
1320014299 is an equidigital number, since it uses as much as digits as its factorization.
1320014299 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 329900.
The product of its (nonzero) digits is 3888, while the sum is 31.
The square root of 1320014299 is about 36332.0010321480. The cubic root of 1320014299 is about 1096.9652714444.
The spelling of 1320014299 in words is "one billion, three hundred twenty million, fourteen thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •