Base | Representation |
---|---|
bin | 10010001100011100100100… |
… | …00110001111010010010100 |
3 | 12020122220222200011202120021 |
4 | 21012032102012033102110 |
5 | 20221011111244040002 |
6 | 221032212330514524 |
7 | 11266426604120461 |
oct | 1106162206172224 |
9 | 166586880152507 |
10 | 40010071471252 |
11 | 118261a3315533 |
12 | 45a2277b95a44 |
13 | 1942c1a01a2cc |
14 | 9c46d7d24668 |
15 | 495b48ee6737 |
hex | 24639218f494 |
40010071471252 has 12 divisors (see below), whose sum is σ = 74136308902740. Its totient is φ = 18828268927616.
The previous prime is 40010071471177. The next prime is 40010071471267. The reversal of 40010071471252 is 25217417001004.
It can be written as a sum of positive squares in 2 ways, for example, as 11902748401296 + 28107323069956 = 3450036^2 + 5301634^2 .
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 294191701927 + ... + 294191702062.
It is an arithmetic number, because the mean of its divisors is an integer number (6178025741895).
Almost surely, 240010071471252 is an apocalyptic number.
It is an amenable number.
40010071471252 is a deficient number, since it is larger than the sum of its proper divisors (34126237431488).
40010071471252 is a wasteful number, since it uses less digits than its factorization.
40010071471252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 588383404010 (or 588383404008 counting only the distinct ones).
The product of its (nonzero) digits is 15680, while the sum is 34.
Adding to 40010071471252 its reverse (25217417001004), we get a palindrome (65227488472256).
The spelling of 40010071471252 in words is "forty trillion, ten billion, seventy-one million, four hundred seventy-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •