Base | Representation |
---|---|
bin | 100101101011000001… |
… | …001000111010111101 |
3 | 10212102001010100210101 |
4 | 211223001020322331 |
5 | 1130320220311321 |
6 | 30325455241101 |
7 | 2631251512315 |
oct | 455301107275 |
9 | 125361110711 |
10 | 40450166461 |
11 | 16178078841 |
12 | 7a0a819191 |
13 | 3a78409c53 |
14 | 1d5a2b0445 |
15 | 10bb2a9791 |
hex | 96b048ebd |
40450166461 has 4 divisors (see below), whose sum is σ = 40464518400. Its totient is φ = 40435814524.
The previous prime is 40450166453. The next prime is 40450166467. The reversal of 40450166461 is 16466105404.
40450166461 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 not a de Polignac number, because 40450166461 - 23 = 40450166453 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 40450166461.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (40450166467) 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, 7171741 + ... + 7177378.
It is an arithmetic number, because the mean of its divisors is an integer number (10116129600).
Almost surely, 240450166461 is an apocalyptic number.
It is an amenable number.
40450166461 is a deficient number, since it is larger than the sum of its proper divisors (14351939).
40450166461 is a wasteful number, since it uses less digits than its factorization.
40450166461 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14351938.
The product of its (nonzero) digits is 69120, while the sum is 37.
The spelling of 40450166461 in words is "forty billion, four hundred fifty million, one hundred sixty-six thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •