Base | Representation |
---|---|
bin | 10010010001111110111011… |
… | …11111011010100110001101 |
3 | 12021100010001122120122111220 |
4 | 21020333131333122212031 |
5 | 20232120230231441023 |
6 | 221255435032033553 |
7 | 11316243326102244 |
oct | 1110773577324615 |
9 | 167303048518456 |
10 | 40200323312013 |
11 | 11899952542387 |
12 | 4613112b328b9 |
13 | 1957b49887507 |
14 | 9cd9c54bb95b |
15 | 49aa817573e3 |
hex | 248fddfda98d |
40200323312013 has 8 divisors (see below), whose sum is σ = 55049091382368. Its totient is φ = 26075885391504.
The previous prime is 40200323311963. The next prime is 40200323312041. The reversal of 40200323312013 is 31021332300204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 40200323312013 - 213 = 40200323303821 is a prime.
It is a super-2 number, since 2×402003233120132 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40200323314013) 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, 181082537331 + ... + 181082537552.
It is an arithmetic number, because the mean of its divisors is an integer number (6881136422796).
Almost surely, 240200323312013 is an apocalyptic number.
It is an amenable number.
40200323312013 is a deficient number, since it is larger than the sum of its proper divisors (14848768070355).
40200323312013 is a wasteful number, since it uses less digits than its factorization.
40200323312013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 362165074923.
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 40200323312013 its reverse (31021332300204), we get a palindrome (71221655612217).
The spelling of 40200323312013 in words is "forty trillion, two hundred billion, three hundred twenty-three million, three hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •