Base | Representation |
---|---|
bin | 10100011101100011010… |
… | …100000001110101001001 |
3 | 11222102102221210102211112 |
4 | 110131203110001311021 |
5 | 141014213322004203 |
6 | 2553543550140105 |
7 | 203405656022666 |
oct | 24354324016511 |
9 | 4872387712745 |
10 | 1406120500553 |
11 | 4a2372401a0a |
12 | 1a8622ab1635 |
13 | a279a943632 |
14 | 4c0b1424a6d |
15 | 2689a64b6d8 |
hex | 14763501d49 |
1406120500553 has 8 divisors (see below), whose sum is σ = 1406937328200. Its totient is φ = 1405303878528.
The previous prime is 1406120500541. The next prime is 1406120500571. The reversal of 1406120500553 is 3550050216041.
It can be written as a sum of positive squares in 4 ways, for example, as 1012937576704 + 393182923849 = 1006448^2 + 627043^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1406120500553 - 28 = 1406120500297 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1406120500583) 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, 14862563 + ... + 14956871.
It is an arithmetic number, because the mean of its divisors is an integer number (175867166025).
Almost surely, 21406120500553 is an apocalyptic number.
It is an amenable number.
1406120500553 is a deficient number, since it is larger than the sum of its proper divisors (816827647).
1406120500553 is an equidigital number, since it uses as much as digits as its factorization.
1406120500553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 102811.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 1406120500553 its reverse (3550050216041), we get a palindrome (4956170716594).
The spelling of 1406120500553 in words is "one trillion, four hundred six billion, one hundred twenty million, five hundred thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •