Base | Representation |
---|---|
bin | 111010011001100001010… |
… | …000001111010000110000 |
3 | 112012122121000011202110211 |
4 | 322121201100033100300 |
5 | 1011222343030214412 |
6 | 12311335035033504 |
7 | 562640062346101 |
oct | 72314120172060 |
9 | 15178530152424 |
10 | 4013131101232 |
11 | 1307a60980350 |
12 | 54993159b894 |
13 | 23158a3b0216 |
14 | dc3452743a8 |
15 | 6e5cdba6ca7 |
hex | 3a66140f430 |
4013131101232 has 80 divisors (see below), whose sum is σ = 8809435044000. Its totient is φ = 1754906757120.
The previous prime is 4013131101227. The next prime is 4013131101283. The reversal of 4013131101232 is 2321011313104.
It is a super-2 number, since 2×40131311012322 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2882607 + ... + 4041742.
It is an arithmetic number, because the mean of its divisors is an integer number (110117938050).
Almost surely, 24013131101232 is an apocalyptic number.
It is an amenable number.
4013131101232 is an abundant number, since it is smaller than the sum of its proper divisors (4796303942768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
4013131101232 is a wasteful number, since it uses less digits than its factorization.
4013131101232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6924494 (or 6924488 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 4013131101232 its reverse (2321011313104), we get a palindrome (6334142414336).
The spelling of 4013131101232 in words is "four trillion, thirteen billion, one hundred thirty-one million, one hundred one thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •