Base | Representation |
---|---|
bin | 101110010001011001111100… |
… | …0010000011101111010101001 |
3 | 1222101010000021011101112220222 |
4 | 1130202303320100131322221 |
5 | 411321442442122421203 |
6 | 4001350534131255425 |
7 | 151505451556430546 |
oct | 13442637020357251 |
9 | 1871100234345828 |
10 | 407012445904553 |
11 | 108761010a14275 |
12 | 397958a474a575 |
13 | 14615155502738 |
14 | 72717167b1bcd |
15 | 320c4db2cd038 |
hex | 1722cf841dea9 |
407012445904553 has 16 divisors (see below), whose sum is σ = 428816934000000. Its totient is φ = 385246350726912.
The previous prime is 407012445904541. The next prime is 407012445904583. The reversal of 407012445904553 is 355409544210704.
It is a cyclic number.
It is not a de Polignac number, because 407012445904553 - 236 = 406943726427817 is a prime.
It is a super-2 number, since 2×4070124459045532 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 407012445904495 and 407012445904504.
It is not an unprimeable number, because it can be changed into a prime (407012445904583) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 126197948 + ... + 129382946.
It is an arithmetic number, because the mean of its divisors is an integer number (26801058375000).
Almost surely, 2407012445904553 is an apocalyptic number.
It is an amenable number.
407012445904553 is a deficient number, since it is larger than the sum of its proper divisors (21804488095447).
407012445904553 is a wasteful number, since it uses less digits than its factorization.
407012445904553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3191024.
The product of its (nonzero) digits is 12096000, while the sum is 53.
The spelling of 407012445904553 in words is "four hundred seven trillion, twelve billion, four hundred forty-five million, nine hundred four thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •