Base | Representation |
---|---|
bin | 101010000001010… |
… | …1110011000001111 |
3 | 10122021011102221000 |
4 | 1110002232120033 |
5 | 10341430003044 |
6 | 351525111343 |
7 | 46640543223 |
oct | 12402563017 |
9 | 3567142830 |
10 | 1410000399 |
11 | 6639aa195 |
12 | 334258553 |
13 | 196170582 |
14 | d5396783 |
15 | 83bbcd69 |
hex | 540ae60f |
1410000399 has 8 divisors (see below), whose sum is σ = 2088889520. Its totient is φ = 940000248.
The previous prime is 1410000331. The next prime is 1410000407. The reversal of 1410000399 is 9930000141.
It is not a de Polignac number, because 1410000399 - 211 = 1409998351 is a prime.
It is a super-2 number, since 2×14100003992 = 3976202250360318402, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 52222237 = 1410000399 / (1 + 4 + 1 + 0 + 0 + 0 + 0 + 3 + 9 + 9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1410000899) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 26111092 + ... + 26111145.
It is an arithmetic number, because the mean of its divisors is an integer number (261111190).
Almost surely, 21410000399 is an apocalyptic number.
1410000399 is a deficient number, since it is larger than the sum of its proper divisors (678889121).
1410000399 is an equidigital number, since it uses as much as digits as its factorization.
1410000399 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 52222246 (or 52222240 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 27.
The square root of 1410000399 is about 37549.9720239576. The cubic root of 1410000399 is about 1121.3462762265.
The spelling of 1410000399 in words is "one billion, four hundred ten million, three hundred ninety-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •