Base | Representation |
---|---|
bin | 10010001111010011101111… |
… | …00100100010000101100001 |
3 | 12021000022211002201221102011 |
4 | 21013221313210202011201 |
5 | 20224114011113104203 |
6 | 221145314405152521 |
7 | 11306510543426143 |
oct | 1107516744420541 |
9 | 167008732657364 |
10 | 40108410675553 |
11 | 11863977225200 |
12 | 45b93416bb741 |
13 | 194c28c728aac |
14 | 9c9386586c93 |
15 | 4984a252376d |
hex | 247a77922161 |
40108410675553 has 12 divisors (see below), whose sum is σ = 44086276908324. Its totient is φ = 36462048761600.
The previous prime is 40108410675539. The next prime is 40108410675673. The reversal of 40108410675553 is 35557601480104.
It can be written as a sum of positive squares in 2 ways, for example, as 12052235686689 + 28056174988864 = 3471633^2 + 5296808^2 .
It is not a de Polignac number, because 40108410675553 - 217 = 40108410544481 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40108410675497 and 40108410675506.
It is not an unprimeable number, because it can be changed into a prime (40108410625553) 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, 41821773 + ... + 42770053.
It is an arithmetic number, because the mean of its divisors is an integer number (3673856409027).
Almost surely, 240108410675553 is an apocalyptic number.
It is an amenable number.
40108410675553 is a deficient number, since it is larger than the sum of its proper divisors (3977866232771).
40108410675553 is a wasteful number, since it uses less digits than its factorization.
40108410675553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1297856 (or 1297845 counting only the distinct ones).
The product of its (nonzero) digits is 2016000, while the sum is 49.
The spelling of 40108410675553 in words is "forty trillion, one hundred eight billion, four hundred ten million, six hundred seventy-five thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •