Base | Representation |
---|---|
bin | 10010011011011010011010… |
… | …10110110001000010111011 |
3 | 12022111002100010200200012112 |
4 | 21031231031112301002323 |
5 | 20302422243422021301 |
6 | 222104340222202535 |
7 | 11351533166460512 |
oct | 1115551526610273 |
9 | 168432303620175 |
10 | 40524314251451 |
11 | 11a042a0a23558 |
12 | 4665a72a2344b |
13 | 197c570b5c374 |
14 | a0155c97b679 |
15 | 4a41e52179bb |
hex | 24db4d5b10bb |
40524314251451 has 4 divisors (see below), whose sum is σ = 40685765702904. Its totient is φ = 40362862800000.
The previous prime is 40524314251439. The next prime is 40524314251559. The reversal of 40524314251451 is 15415241342504.
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 40524314251451 - 26 = 40524314251387 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 40524314251399 and 40524314251408.
It is not an unprimeable number, because it can be changed into a prime (40824314251451) 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, 80725725350 + ... + 80725725851.
It is an arithmetic number, because the mean of its divisors is an integer number (10171441425726).
Almost surely, 240524314251451 is an apocalyptic number.
40524314251451 is a deficient number, since it is larger than the sum of its proper divisors (161451451453).
40524314251451 is a wasteful number, since it uses less digits than its factorization.
40524314251451 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161451451452.
The product of its (nonzero) digits is 384000, while the sum is 41.
Adding to 40524314251451 its reverse (15415241342504), we get a palindrome (55939555593955).
The spelling of 40524314251451 in words is "forty trillion, five hundred twenty-four billion, three hundred fourteen million, two hundred fifty-one thousand, four hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •