Base | Representation |
---|---|
bin | 100101101111111101… |
… | …100011100100101011 |
3 | 10212121211012111020021 |
4 | 211233331203210223 |
5 | 1131002434110011 |
6 | 30342021141311 |
7 | 2633306530330 |
oct | 455775434453 |
9 | 125554174207 |
10 | 40533113131 |
11 | 1620a981905 |
12 | 7a3255a837 |
13 | 3a8c65c614 |
14 | 1d67302987 |
15 | 10c36e1471 |
hex | 96ff6392b |
40533113131 has 8 divisors (see below), whose sum is σ = 46325698560. Its totient is φ = 34741062888.
The previous prime is 40533113123. The next prime is 40533113171. The reversal of 40533113131 is 13131133504.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40533113131 - 23 = 40533113123 is a prime.
It is a super-2 number, since 2×405331131312 (a number of 22 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 = 40533113096 and 40533113105.
It is not an unprimeable number, because it can be changed into a prime (40533113111) 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, 44310 + ... + 288148.
It is an arithmetic number, because the mean of its divisors is an integer number (5790712320).
Almost surely, 240533113131 is an apocalyptic number.
40533113131 is a deficient number, since it is larger than the sum of its proper divisors (5792585429).
40533113131 is a wasteful number, since it uses less digits than its factorization.
40533113131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267593.
The product of its (nonzero) digits is 1620, while the sum is 25.
Adding to 40533113131 its reverse (13131133504), we get a palindrome (53664246635).
It can be divided in two parts, 40533 and 113131, that added together give a square (153664 = 3922).
The spelling of 40533113131 in words is "forty billion, five hundred thirty-three million, one hundred thirteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •