Base | Representation |
---|---|
bin | 1011110110101010011… |
… | …11001111101111000001 |
3 | 1102221022202012212100001 |
4 | 11323111033033233001 |
5 | 23133124421010231 |
6 | 511040232200001 |
7 | 41266245603202 |
oct | 5732517175701 |
9 | 1387282185301 |
10 | 407304469441 |
11 | 147811833401 |
12 | 66b31539001 |
13 | 2c540a484cc |
14 | 159dc3375a9 |
15 | a8dcd05b61 |
hex | 5ed53cfbc1 |
407304469441 has 4 divisors (see below), whose sum is σ = 428741546800. Its totient is φ = 385867392084.
The previous prime is 407304469423. The next prime is 407304469477. The reversal of 407304469441 is 144964403704.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-407304469441 is a prime.
It is a super-2 number, since 2×4073044694412 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 407304469391 and 407304469400.
It is not an unprimeable number, because it can be changed into a prime (407304419441) 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, 10718538651 + ... + 10718538688.
It is an arithmetic number, because the mean of its divisors is an integer number (107185386700).
Almost surely, 2407304469441 is an apocalyptic number.
It is an amenable number.
407304469441 is a deficient number, since it is larger than the sum of its proper divisors (21437077359).
407304469441 is a wasteful number, since it uses less digits than its factorization.
407304469441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21437077358.
The product of its (nonzero) digits is 1161216, while the sum is 46.
The spelling of 407304469441 in words is "four hundred seven billion, three hundred four million, four hundred sixty-nine thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.128 sec. • engine limits •