Base | Representation |
---|---|
bin | 10010011001010110010111… |
… | …11111010000001110101011 |
3 | 12022020022100200211120012111 |
4 | 21030223023333100032223 |
5 | 20300242103113200443 |
6 | 222012014021423151 |
7 | 11343443365322401 |
oct | 1114531377201653 |
9 | 168208320746174 |
10 | 40453424350123 |
11 | 11987223477444 |
12 | 4654189b6aab7 |
13 | 1975984245aa5 |
14 | 9dbd55ab7471 |
15 | 4a244692269d |
hex | 24cacbfd03ab |
40453424350123 has 4 divisors (see below), whose sum is σ = 40744456180120. Its totient is φ = 40162392520128.
The previous prime is 40453424350099. The next prime is 40453424350159. The reversal of 40453424350123 is 32105342435404.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 40453424350123 - 213 = 40453424341931 is a prime.
It is a super-2 number, since 2×404534243501232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (40453424350223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 145515914790 + ... + 145515915067.
It is an arithmetic number, because the mean of its divisors is an integer number (10186114045030).
Almost surely, 240453424350123 is an apocalyptic number.
40453424350123 is a deficient number, since it is larger than the sum of its proper divisors (291031829997).
40453424350123 is a wasteful number, since it uses less digits than its factorization.
40453424350123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291031829996.
The product of its (nonzero) digits is 691200, while the sum is 40.
Adding to 40453424350123 its reverse (32105342435404), we get a palindrome (72558766785527).
The spelling of 40453424350123 in words is "forty trillion, four hundred fifty-three billion, four hundred twenty-four million, three hundred fifty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •