Base | Representation |
---|---|
bin | 10010010011100101110001… |
… | …10111011000100001001011 |
3 | 12021112101120110011020020011 |
4 | 21021302320313120201023 |
5 | 20234021313431233303 |
6 | 221341045410412351 |
7 | 11323236453650212 |
oct | 1111627067304113 |
9 | 167471513136204 |
10 | 40255535024203 |
11 | 11910305074994 |
12 | 46219612910b7 |
13 | 19601082b10b5 |
14 | 9d2542060079 |
15 | 49c21392316d |
hex | 249cb8dd884b |
40255535024203 has 8 divisors (see below), whose sum is σ = 41241398726000. Its totient is φ = 39271929889248.
The previous prime is 40255535024153. The next prime is 40255535024213. The reversal of 40255535024203 is 30242053555204.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-40255535024203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40255535024213) 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, 564605628 + ... + 564676921.
It is an arithmetic number, because the mean of its divisors is an integer number (5155174840750).
Almost surely, 240255535024203 is an apocalyptic number.
40255535024203 is a gapful number since it is divisible by the number (43) formed by its first and last digit.
40255535024203 is a deficient number, since it is larger than the sum of its proper divisors (985863701797).
40255535024203 is a wasteful number, since it uses less digits than its factorization.
40255535024203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1129283421.
The product of its (nonzero) digits is 720000, while the sum is 40.
Adding to 40255535024203 its reverse (30242053555204), we get a palindrome (70497588579407).
The spelling of 40255535024203 in words is "forty trillion, two hundred fifty-five billion, five hundred thirty-five million, twenty-four thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •