Base | Representation |
---|---|
bin | 10010010000101100011110… |
… | …10011011111100111111111 |
3 | 12021011212210102010022102222 |
4 | 21020112033103133213333 |
5 | 20230404044144034323 |
6 | 221223234124235555 |
7 | 11313115303656143 |
oct | 1110261723374777 |
9 | 167155712108388 |
10 | 40156053502463 |
11 | 118820a5377218 |
12 | 460661909bbbb |
13 | 1953913026332 |
14 | 9cb7c5c05223 |
15 | 49983eea19c8 |
hex | 24858f4df9ff |
40156053502463 has 4 divisors (see below), whose sum is σ = 40175864088360. Its totient is φ = 40136242916568.
The previous prime is 40156053502441. The next prime is 40156053502493. The reversal of 40156053502463 is 36420535065104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 40156053502463 - 26 = 40156053502399 is a prime.
It is a super-2 number, since 2×401560535024632 (a number of 28 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 (40156053502493) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9905289908 + ... + 9905293961.
It is an arithmetic number, because the mean of its divisors is an integer number (10043966022090).
Almost surely, 240156053502463 is an apocalyptic number.
40156053502463 is a deficient number, since it is larger than the sum of its proper divisors (19810585897).
40156053502463 is a wasteful number, since it uses less digits than its factorization.
40156053502463 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19810585896.
The product of its (nonzero) digits is 1296000, while the sum is 44.
Adding to 40156053502463 its reverse (36420535065104), we get a palindrome (76576588567567).
The spelling of 40156053502463 in words is "forty trillion, one hundred fifty-six billion, fifty-three million, five hundred two thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •