Base | Representation |
---|---|
bin | 10010001111111111101111… |
… | …01000010111010101001010 |
3 | 12021002120210110012011200010 |
4 | 21013333313220113111022 |
5 | 20230010401201001302 |
6 | 221204222451052350 |
7 | 11311305133401564 |
oct | 1107776750272512 |
9 | 167076713164603 |
10 | 40132034000202 |
11 | 11872999a53701 |
12 | 4601a34ba10b6 |
13 | 195158598c2c1 |
14 | 9ca587b70334 |
15 | 498dd640c16c |
hex | 247ff7a1754a |
40132034000202 has 64 divisors (see below), whose sum is σ = 83462214528000. Its totient is φ = 12850673379840.
The previous prime is 40132034000197. The next prime is 40132034000207. The reversal of 40132034000202 is 20200043023104.
It is an interprime number because it is at equal distance from previous prime (40132034000197) and next prime (40132034000207).
It is a super-2 number, since 2×401320340002022 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (40132034000207) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 947628924 + ... + 947671272.
It is an arithmetic number, because the mean of its divisors is an integer number (1304097102000).
Almost surely, 240132034000202 is an apocalyptic number.
40132034000202 is an abundant number, since it is smaller than the sum of its proper divisors (43330180527798).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
40132034000202 is a wasteful number, since it uses less digits than its factorization.
40132034000202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79711.
The product of its (nonzero) digits is 1152, while the sum is 21.
Adding to 40132034000202 its reverse (20200043023104), we get a palindrome (60332077023306).
The spelling of 40132034000202 in words is "forty trillion, one hundred thirty-two billion, thirty-four million, two hundred two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •