Base | Representation |
---|---|
bin | 101110000100001110000110… |
… | …0101110011101010111110011 |
3 | 1222010200202211111211200001001 |
4 | 1130020130030232131113303 |
5 | 411102300220124041201 |
6 | 3553442242024422431 |
7 | 151230520332021562 |
oct | 13410341456352763 |
9 | 1863622744750031 |
10 | 405200313112051 |
11 | 108122540224046 |
12 | 39542651017a17 |
13 | 145132c1770192 |
14 | 720bb2a8d9bd9 |
15 | 31ca2cb523301 |
hex | 170870cb9d5f3 |
405200313112051 has 8 divisors (see below), whose sum is σ = 429035994354240. Its totient is φ = 381364672837248.
The previous prime is 405200313112039. The next prime is 405200313112069. The reversal of 405200313112051 is 150211313002504.
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 405200313112051 - 25 = 405200313112019 is a prime.
It is a super-2 number, since 2×4052003131120512 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (405200313112151) 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, 11432070 + ... + 30677236.
It is an arithmetic number, because the mean of its divisors is an integer number (53629499294280).
Almost surely, 2405200313112051 is an apocalyptic number.
405200313112051 is a deficient number, since it is larger than the sum of its proper divisors (23835681242189).
405200313112051 is a wasteful number, since it uses less digits than its factorization.
405200313112051 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20483693.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 405200313112051 its reverse (150211313002504), we get a palindrome (555411626114555).
The spelling of 405200313112051 in words is "four hundred five trillion, two hundred billion, three hundred thirteen million, one hundred twelve thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •