Base | Representation |
---|---|
bin | 1011101001111111110… |
… | …00011010000110110101 |
3 | 1102021202210101111101200 |
4 | 11310333320122012311 |
5 | 23030212422211013 |
6 | 503553332243113 |
7 | 40635566236452 |
oct | 5647770320665 |
9 | 1367683344350 |
10 | 400503710133 |
11 | 1449419a326a |
12 | 65753a70499 |
13 | 2b9c8ac2087 |
14 | 15555042829 |
15 | a640c45e73 |
hex | 5d3fe1a1b5 |
400503710133 has 12 divisors (see below), whose sum is σ = 580221996588. Its totient is φ = 266210179200.
The previous prime is 400503710081. The next prime is 400503710137. The reversal of 400503710133 is 331017305004.
It can be written as a sum of positive squares in 2 ways, for example, as 29746935729 + 370756774404 = 172473^2 + 608898^2 .
It is not a de Polignac number, because 400503710133 - 28 = 400503709877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 400503710097 and 400503710106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (400503710137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 66021318 + ... + 66027383.
It is an arithmetic number, because the mean of its divisors is an integer number (48351833049).
Almost surely, 2400503710133 is an apocalyptic number.
It is an amenable number.
400503710133 is a deficient number, since it is larger than the sum of its proper divisors (179718286455).
400503710133 is a wasteful number, since it uses less digits than its factorization.
400503710133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132049044 (or 132049041 counting only the distinct ones).
The product of its (nonzero) digits is 3780, while the sum is 27.
The spelling of 400503710133 in words is "four hundred billion, five hundred three million, seven hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •