Base | Representation |
---|---|
bin | 1011110010100111111… |
… | …01000101111110101111 |
3 | 1102201201120211021001211 |
4 | 11321103331011332233 |
5 | 23114204133400111 |
6 | 510041110415251 |
7 | 41161430335354 |
oct | 5712375057657 |
9 | 1381646737054 |
10 | 405135450031 |
11 | 1468a9443a84 |
12 | 66627061527 |
13 | 2c286573280 |
14 | 1587424262b |
15 | a8126a8521 |
hex | 5e53f45faf |
405135450031 has 8 divisors (see below), whose sum is σ = 438256219520. Its totient is φ = 372294181152.
The previous prime is 405135450023. The next prime is 405135450047. The reversal of 405135450031 is 130054531504.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 405135450031 - 23 = 405135450023 is a prime.
It is a super-2 number, since 2×4051354500312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 405135449975 and 405135450002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (405135450091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 69872136 + ... + 69877933.
It is an arithmetic number, because the mean of its divisors is an integer number (54782027440).
Almost surely, 2405135450031 is an apocalyptic number.
405135450031 is a deficient number, since it is larger than the sum of its proper divisors (33120769489).
405135450031 is a wasteful number, since it uses less digits than its factorization.
405135450031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139750305.
The product of its (nonzero) digits is 18000, while the sum is 31.
Adding to 405135450031 its reverse (130054531504), we get a palindrome (535189981535).
The spelling of 405135450031 in words is "four hundred five billion, one hundred thirty-five million, four hundred fifty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •