Base | Representation |
---|---|
bin | 101010000111101… |
… | …0011111101010111 |
3 | 10122111101002012111 |
4 | 1110033103331113 |
5 | 10343301100210 |
6 | 352123531451 |
7 | 50010565216 |
oct | 12417237527 |
9 | 3574332174 |
10 | 1413300055 |
11 | 665853282 |
12 | 335389b87 |
13 | 196a5742b |
14 | d59b507d |
15 | 8412088a |
hex | 543d3f57 |
1413300055 has 4 divisors (see below), whose sum is σ = 1695960072. Its totient is φ = 1130640040.
The previous prime is 1413300041. The next prime is 1413300059. The reversal of 1413300055 is 5500033141.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 1413300055 - 215 = 1413267287 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1413299999 and 1413300035.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1413300059) 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, 141330001 + ... + 141330010.
It is an arithmetic number, because the mean of its divisors is an integer number (423990018).
Almost surely, 21413300055 is an apocalyptic number.
1413300055 is a deficient number, since it is larger than the sum of its proper divisors (282660017).
1413300055 is an equidigital number, since it uses as much as digits as its factorization.
1413300055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282660016.
The product of its (nonzero) digits is 900, while the sum is 22.
The square root of 1413300055 is about 37593.8832125653. The cubic root of 1413300055 is about 1122.2203124915.
Adding to 1413300055 its reverse (5500033141), we get a palindrome (6913333196).
The spelling of 1413300055 in words is "one billion, four hundred thirteen million, three hundred thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.123 sec. • engine limits •