Base | Representation |
---|---|
bin | 101001101100110… |
… | …1101100010011011 |
3 | 10121111221012211221 |
4 | 1103121231202123 |
5 | 10331201432201 |
6 | 350502432511 |
7 | 46450264204 |
oct | 12331554233 |
9 | 3544835757 |
10 | 1399249051 |
11 | 658926582 |
12 | 330732737 |
13 | 193b77a25 |
14 | d3b985ab |
15 | 82c974a1 |
hex | 5366d89b |
1399249051 has 4 divisors (see below), whose sum is σ = 1413103104. Its totient is φ = 1385395000.
The previous prime is 1399249037. The next prime is 1399249063. The reversal of 1399249051 is 1509429931.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1509429931 = 113 ⋅13357787.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1399249051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1399248989 and 1399249007.
It is not an unprimeable number, because it can be changed into a prime (1399249031) 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 3 ways as a sum of consecutive naturals, for example, 6926875 + ... + 6927076.
It is an arithmetic number, because the mean of its divisors is an integer number (353275776).
Almost surely, 21399249051 is an apocalyptic number.
1399249051 is a deficient number, since it is larger than the sum of its proper divisors (13854053).
1399249051 is a wasteful number, since it uses less digits than its factorization.
1399249051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13854052.
The product of its (nonzero) digits is 87480, while the sum is 43.
The square root of 1399249051 is about 37406.5375435899. The cubic root of 1399249051 is about 1118.4888876550.
The spelling of 1399249051 in words is "one billion, three hundred ninety-nine million, two hundred forty-nine thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •