Base | Representation |
---|---|
bin | 10010011001010111011100… |
… | …11100111010101011001111 |
3 | 12022020100211222211020101102 |
4 | 21030223232130322223033 |
5 | 20300244244123122003 |
6 | 222012151234333315 |
7 | 11343463616051612 |
oct | 1114535634725317 |
9 | 168210758736342 |
10 | 40454002551503 |
11 | 1198749a896722 |
12 | 465430b72a23b |
13 | 1975a46c7b698 |
14 | 9dbdac7c8179 |
15 | 4a247c586588 |
hex | 24caee73aacf |
40454002551503 has 8 divisors (see below), whose sum is σ = 40479858857088. Its totient is φ = 40428151672864.
The previous prime is 40454002551497. The next prime is 40454002551511. The reversal of 40454002551503 is 30515520045404.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 40454002551503 - 242 = 36055956040399 is a prime.
It is a super-2 number, since 2×404540025515032 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40454002551563) 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, 13609301 + ... + 16313217.
It is an arithmetic number, because the mean of its divisors is an integer number (5059982357136).
Almost surely, 240454002551503 is an apocalyptic number.
40454002551503 is a deficient number, since it is larger than the sum of its proper divisors (25856305585).
40454002551503 is a wasteful number, since it uses less digits than its factorization.
40454002551503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2713473.
The product of its (nonzero) digits is 240000, while the sum is 38.
Adding to 40454002551503 its reverse (30515520045404), we get a palindrome (70969522596907).
The spelling of 40454002551503 in words is "forty trillion, four hundred fifty-four billion, two million, five hundred fifty-one thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •