Base | Representation |
---|---|
bin | 101101101001110001011110… |
… | …0111111010001000011111101 |
3 | 1221122211021120110122111000020 |
4 | 1123103202330333101003331 |
5 | 410113222001322232011 |
6 | 3542020340241122353 |
7 | 150404100530643225 |
oct | 13323427477210375 |
9 | 1848737513574006 |
10 | 401565433008381 |
11 | 106a50a42164714 |
12 | 390560a30293b9 |
13 | 1430b5c4b7aaa5 |
14 | 7123c29143085 |
15 | 3165989bb6006 |
hex | 16d38bcfd10fd |
401565433008381 has 16 divisors (see below), whose sum is σ = 545523586045056. Its totient is φ = 262658797908416.
The previous prime is 401565433008353. The next prime is 401565433008391. The reversal of 401565433008381 is 183800334565104.
It is a cyclic number.
It is not a de Polignac number, because 401565433008381 - 26 = 401565433008317 is a prime.
It is a super-2 number, since 2×4015654330083812 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (401565433008391) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 173666071 + ... + 175963163.
It is an arithmetic number, because the mean of its divisors is an integer number (34095224127816).
Almost surely, 2401565433008381 is an apocalyptic number.
It is an amenable number.
401565433008381 is a deficient number, since it is larger than the sum of its proper divisors (143958153036675).
401565433008381 is a wasteful number, since it uses less digits than its factorization.
401565433008381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3396612.
The product of its (nonzero) digits is 4147200, while the sum is 51.
The spelling of 401565433008381 in words is "four hundred one trillion, five hundred sixty-five billion, four hundred thirty-three million, eight thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •