Base | Representation |
---|---|
bin | 10100011100010000110… |
… | …110011100010100111111 |
3 | 11222021212112111222202211 |
4 | 110130100312130110333 |
5 | 141003400133404210 |
6 | 2553154405201251 |
7 | 203326456412515 |
oct | 24342066342477 |
9 | 4867775458684 |
10 | 1404737013055 |
11 | 4a1822471312 |
12 | 1a82b7700227 |
13 | a260a126a8c |
14 | 4bdbd7b04b5 |
15 | 26818e6938a |
hex | 14710d9c53f |
1404737013055 has 32 divisors (see below), whose sum is σ = 1706823256320. Its totient is φ = 1109806272000.
The previous prime is 1404737013041. The next prime is 1404737013059. The reversal of 1404737013055 is 5503107374041.
It is not a de Polignac number, because 1404737013055 - 25 = 1404737013023 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1404737012999 and 1404737013017.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1404737013059) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 88568716 + ... + 88584574.
It is an arithmetic number, because the mean of its divisors is an integer number (53338226760).
Almost surely, 21404737013055 is an apocalyptic number.
1404737013055 is a deficient number, since it is larger than the sum of its proper divisors (302086243265).
1404737013055 is a wasteful number, since it uses less digits than its factorization.
1404737013055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16711.
The product of its (nonzero) digits is 176400, while the sum is 40.
The spelling of 1404737013055 in words is "one trillion, four hundred four billion, seven hundred thirty-seven million, thirteen thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •