Base | Representation |
---|---|
bin | 101110000010110101101110… |
… | …0110110101110000011010101 |
3 | 1222010000121222022002022100011 |
4 | 1130011223130312232003111 |
5 | 411041143032020111013 |
6 | 3553215134120120221 |
7 | 151211021346124225 |
oct | 13405533466560325 |
9 | 1863017868068304 |
10 | 405010531410133 |
11 | 10805a0024184a0 |
12 | 39511907606071 |
13 | 144cb43843133c |
14 | 7202885964085 |
15 | 31c53c01ccc3d |
hex | 1705adcdae0d5 |
405010531410133 has 16 divisors (see below), whose sum is σ = 461104566091776. Its totient is φ = 352133486929840.
The previous prime is 405010531410131. The next prime is 405010531410169. The reversal of 405010531410133 is 331014135010504.
It is not a de Polignac number, because 405010531410133 - 21 = 405010531410131 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 405010531410095 and 405010531410104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (405010531410131) 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, 110889985 + ... + 114484102.
It is an arithmetic number, because the mean of its divisors is an integer number (28819035380736).
Almost surely, 2405010531410133 is an apocalyptic number.
It is an amenable number.
405010531410133 is a deficient number, since it is larger than the sum of its proper divisors (56094034681643).
405010531410133 is a wasteful number, since it uses less digits than its factorization.
405010531410133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 225381224.
The product of its (nonzero) digits is 10800, while the sum is 31.
Adding to 405010531410133 its reverse (331014135010504), we get a palindrome (736024666420637).
The spelling of 405010531410133 in words is "four hundred five trillion, ten billion, five hundred thirty-one million, four hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •