Base | Representation |
---|---|
bin | 111011010110001001110011… |
… | …1100101000001111100101000 |
3 | 2112110022001220212021010012221 |
4 | 1312230103213211001330220 |
5 | 1021410140100330300130 |
6 | 5050122003451043424 |
7 | 214645165524054361 |
oct | 16654234745017450 |
9 | 2473261825233187 |
10 | 522014210400040 |
11 | 141369a8a985556 |
12 | 4a669a26a40574 |
13 | 195379622a6907 |
14 | 92c98a056cb68 |
15 | 4053bc30a587a |
hex | 1dac4e7941f28 |
522014210400040 has 32 divisors (see below), whose sum is σ = 1179211383675360. Its totient is φ = 207973789000000.
The previous prime is 522014210399933. The next prime is 522014210400047. The reversal of 522014210400040 is 40004012410225.
It is a junction number, because it is equal to n+sod(n) for n = 522014210399978 and 522014210400014.
It is not an unprimeable number, because it can be changed into a prime (522014210400047) 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, 25996713586 + ... + 25996733665.
It is an arithmetic number, because the mean of its divisors is an integer number (36850355739855).
Almost surely, 2522014210400040 is an apocalyptic number.
It is an amenable number.
522014210400040 is an abundant number, since it is smaller than the sum of its proper divisors (657197173275320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
522014210400040 is a wasteful number, since it uses less digits than its factorization.
522014210400040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 51993447513 (or 51993447509 counting only the distinct ones).
The product of its (nonzero) digits is 2560, while the sum is 25.
Adding to 522014210400040 its reverse (40004012410225), we get a palindrome (562018222810265).
The spelling of 522014210400040 in words is "five hundred twenty-two trillion, fourteen billion, two hundred ten million, four hundred thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •