Base | Representation |
---|---|
bin | 1001100011011000010001… |
… | …0000111010110111011101 |
3 | 1101012010010222121112001222 |
4 | 2120312010100322313131 |
5 | 2334041443000113103 |
6 | 34201111331343125 |
7 | 2132563251326024 |
oct | 230660420726735 |
9 | 41163128545058 |
10 | 10503414066653 |
11 | 338a522465302 |
12 | 1217770151aa5 |
13 | 5b26106b5981 |
14 | 2845219418bb |
15 | 13334065b638 |
hex | 98d8443addd |
10503414066653 has 16 divisors (see below), whose sum is σ = 11067646187520. Its totient is φ = 9948165777264.
The previous prime is 10503414066473. The next prime is 10503414066659. The reversal of 10503414066653 is 35666041430501.
10503414066653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 10503414066653 - 222 = 10503409872349 is a prime.
It is a super-2 number, since 2×105034140666532 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10503414066659) 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, 22997168 + ... + 23449446.
It is an arithmetic number, because the mean of its divisors is an integer number (691727886720).
Almost surely, 210503414066653 is an apocalyptic number.
It is an amenable number.
10503414066653 is a deficient number, since it is larger than the sum of its proper divisors (564232120867).
10503414066653 is a wasteful number, since it uses less digits than its factorization.
10503414066653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 462208.
The product of its (nonzero) digits is 777600, while the sum is 44.
The spelling of 10503414066653 in words is "ten trillion, five hundred three billion, four hundred fourteen million, sixty-six thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •