Base | Representation |
---|---|
bin | 10010010111111011011110… |
… | …00101100100011001000001 |
3 | 12022001122101111212210010220 |
4 | 21023331233011210121001 |
5 | 20243442130444143400 |
6 | 221533343210213253 |
7 | 11340065114363346 |
oct | 1113755705443101 |
9 | 168048344783126 |
10 | 40404621084225 |
11 | 1196855a28a442 |
12 | 4646829a24229 |
13 | 19711a73c5b68 |
14 | 9d98462a67cd |
15 | 4a103c1707a0 |
hex | 24bf6f164641 |
40404621084225 has 48 divisors (see below), whose sum is σ = 66984167203200. Its totient is φ = 21490483409920.
The previous prime is 40404621084221. The next prime is 40404621084277. The reversal of 40404621084225 is 52248012640404.
40404621084225 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 40404621084225 - 22 = 40404621084221 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (40404621084221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 199251436 + ... + 199454114.
It is an arithmetic number, because the mean of its divisors is an integer number (1395503483400).
Almost surely, 240404621084225 is an apocalyptic number.
It is an amenable number.
40404621084225 is a deficient number, since it is larger than the sum of its proper divisors (26579546118975).
40404621084225 is a wasteful number, since it uses less digits than its factorization.
40404621084225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 209914 (or 209909 counting only the distinct ones).
The product of its (nonzero) digits is 491520, while the sum is 42.
The spelling of 40404621084225 in words is "forty trillion, four hundred four billion, six hundred twenty-one million, eighty-four thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •