Base | Representation |
---|---|
bin | 1001011110010100101100… |
… | …0111101100100001111001 |
3 | 1100212210221200211122011021 |
4 | 2113211023013230201321 |
5 | 2331131101314021101 |
6 | 34053144425502441 |
7 | 2123366653054054 |
oct | 227451307544171 |
9 | 40783850748137 |
10 | 10416556001401 |
11 | 3356700338300 |
12 | 120296b641a21 |
13 | 5a737a7b1aa4 |
14 | 280242035a9b |
15 | 130e5a05d5a1 |
hex | 9794b1ec879 |
10416556001401 has 12 divisors (see below), whose sum is σ = 11452425601876. Its totient is φ = 9467261781120.
The previous prime is 10416556001359. The next prime is 10416556001407. The reversal of 10416556001401 is 10410065561401.
It can be written as a sum of positive squares in 2 ways, for example, as 5469049960000 + 4947506041401 = 2338600^2 + 2224299^2 .
It is not a de Polignac number, because 10416556001401 - 227 = 10416421783673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10416556001407) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10118820 + ... + 11100613.
Almost surely, 210416556001401 is an apocalyptic number.
10416556001401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10416556001401 is a deficient number, since it is larger than the sum of its proper divisors (1035869600475).
10416556001401 is a wasteful number, since it uses less digits than its factorization.
10416556001401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21223512 (or 21223501 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 34.
The spelling of 10416556001401 in words is "ten trillion, four hundred sixteen billion, five hundred fifty-six million, one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •