Base | Representation |
---|---|
bin | 101010000111110… |
… | …1100010111110111 |
3 | 10122111120011101012 |
4 | 1110033230113313 |
5 | 10343312300210 |
6 | 352130022435 |
7 | 50011462604 |
oct | 12417542767 |
9 | 3574504335 |
10 | 1413400055 |
11 | 665911421 |
12 | 335417a1b |
13 | 196a90ac2 |
14 | d59dd6ab |
15 | 84140305 |
hex | 543ec5f7 |
1413400055 has 4 divisors (see below), whose sum is σ = 1696080072. Its totient is φ = 1130720040.
The previous prime is 1413400049. The next prime is 1413400069. The reversal of 1413400055 is 5500043141.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5500043141 = 1151 ⋅4778491.
It is not a de Polignac number, because 1413400055 - 24 = 1413400039 is a prime.
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 1413400055.
It is a congruent number.
It is an unprimeable number.
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, 141340001 + ... + 141340010.
It is an arithmetic number, because the mean of its divisors is an integer number (424020018).
Almost surely, 21413400055 is an apocalyptic number.
1413400055 is a deficient number, since it is larger than the sum of its proper divisors (282680017).
1413400055 is an equidigital number, since it uses as much as digits as its factorization.
1413400055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282680016.
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 1413400055 is about 37595.2131926393. The cubic root of 1413400055 is about 1122.2467799507.
Adding to 1413400055 its reverse (5500043141), we get a palindrome (6913443196).
The spelling of 1413400055 in words is "one billion, four hundred thirteen million, four hundred thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •