Base | Representation |
---|---|
bin | 1011101001011110101… |
… | …11111100111111111101 |
3 | 1102021001111021022121212 |
4 | 11310233113330333331 |
5 | 23024131023014340 |
6 | 503510040334205 |
7 | 40625664246563 |
oct | 5645727747775 |
9 | 1367044238555 |
10 | 400226766845 |
11 | 14480a637714 |
12 | 65697174365 |
13 | 2b983607ac9 |
14 | 1552a351a33 |
15 | a62678da65 |
hex | 5d2f5fcffd |
400226766845 has 8 divisors (see below), whose sum is σ = 480313179864. Its totient is φ = 320154040384.
The previous prime is 400226766839. The next prime is 400226766853. The reversal of 400226766845 is 548667622004.
It can be written as a sum of positive squares in 4 ways, for example, as 36055553689 + 364171213156 = 189883^2 + 603466^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 400226766845 - 214 = 400226750461 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 400226766793 and 400226766802.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3357194 + ... + 3474363.
It is an arithmetic number, because the mean of its divisors is an integer number (60039147483).
Almost surely, 2400226766845 is an apocalyptic number.
It is an amenable number.
400226766845 is a deficient number, since it is larger than the sum of its proper divisors (80086413019).
400226766845 is a wasteful number, since it uses less digits than its factorization.
400226766845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6843279.
The product of its (nonzero) digits is 3870720, while the sum is 50.
The spelling of 400226766845 in words is "four hundred billion, two hundred twenty-six million, seven hundred sixty-six thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •