Base | Representation |
---|---|
bin | 11101100000010011010… |
… | …10011110111001011001 |
3 | 10120220201200102010102100 |
4 | 32300021222132321121 |
5 | 113102202222212101 |
6 | 2053415503554013 |
7 | 133146163222461 |
oct | 16601152367131 |
9 | 3526650363370 |
10 | 1013774413401 |
11 | 360a37255622 |
12 | 144586bbb909 |
13 | 747a1c32209 |
14 | 370d199aba1 |
15 | 1b585b88e86 |
hex | ec09a9ee59 |
1013774413401 has 12 divisors (see below), whose sum is σ = 1464646398228. Its totient is φ = 675708572544.
The previous prime is 1013774413373. The next prime is 1013774413409. The reversal of 1013774413401 is 1043144773101.
1013774413401 is a `hidden beast` number, since 1 + 0 + 137 + 74 + 413 + 40 + 1 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 457145015625 + 556629397776 = 676125^2 + 746076^2 .
It is not a de Polignac number, because 1013774413401 - 217 = 1013774282329 is a prime.
It is a super-2 number, since 2×10137744134012 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1013774413409) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11707500 + ... + 11793773.
It is an arithmetic number, because the mean of its divisors is an integer number (122053866519).
Almost surely, 21013774413401 is an apocalyptic number.
It is an amenable number.
1013774413401 is a deficient number, since it is larger than the sum of its proper divisors (450871984827).
1013774413401 is a wasteful number, since it uses less digits than its factorization.
1013774413401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23506072 (or 23506069 counting only the distinct ones).
The product of its (nonzero) digits is 28224, while the sum is 36.
The spelling of 1013774413401 in words is "one trillion, thirteen billion, seven hundred seventy-four million, four hundred thirteen thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •