Base | Representation |
---|---|
bin | 100101100101001010… |
… | …111001001011100011 |
3 | 10212011012112001012121 |
4 | 211211022321023203 |
5 | 1130120111411011 |
6 | 30312032405111 |
7 | 2625650565115 |
oct | 454512711343 |
9 | 125135461177 |
10 | 40352060131 |
11 | 16127760029 |
12 | 79a19a6797 |
13 | 3a60caa376 |
14 | 1d4b2533b5 |
15 | 10b287ae71 |
hex | 9652b92e3 |
40352060131 has 16 divisors (see below), whose sum is σ = 42755388480. Its totient is φ = 38004595200.
The previous prime is 40352060123. The next prime is 40352060159. The reversal of 40352060131 is 13106025304.
40352060131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 40352060131 - 23 = 40352060123 is a prime.
It is a super-2 number, since 2×403520601312 (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 = 40352060096 and 40352060105.
It is not an unprimeable number, because it can be changed into a prime (40352060831) 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, 989085 + ... + 1029073.
It is an arithmetic number, because the mean of its divisors is an integer number (2672211780).
Almost surely, 240352060131 is an apocalyptic number.
40352060131 is a deficient number, since it is larger than the sum of its proper divisors (2403328349).
40352060131 is a wasteful number, since it uses less digits than its factorization.
40352060131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40686.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 40352060131 its reverse (13106025304), we get a palindrome (53458085435).
The spelling of 40352060131 in words is "forty billion, three hundred fifty-two million, sixty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •