Base | Representation |
---|---|
bin | 1011101101010010001… |
… | …01000000100000000001 |
3 | 1102110022210101020200110 |
4 | 11312221011000200001 |
5 | 23042321231331201 |
6 | 504444420341533 |
7 | 41030406600555 |
oct | 5665105004001 |
9 | 1373283336613 |
10 | 402268620801 |
11 | 145668170823 |
12 | 65b66b448a9 |
13 | 2bc1a647808 |
14 | 156815c3865 |
15 | a6e5b6c6d6 |
hex | 5da9140801 |
402268620801 has 8 divisors (see below), whose sum is σ = 537300796320. Its totient is φ = 267707762912.
The previous prime is 402268620797. The next prime is 402268620827. The reversal of 402268620801 is 108026862204.
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 402268620801 - 22 = 402268620797 is a prime.
It is a super-2 number, since 2×4022686208012 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 402268620801.
It is not an unprimeable number, because it can be changed into a prime (402268620841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 117827415 + ... + 117830828.
It is an arithmetic number, because the mean of its divisors is an integer number (67162599540).
Almost surely, 2402268620801 is an apocalyptic number.
It is an amenable number.
402268620801 is a deficient number, since it is larger than the sum of its proper divisors (135032175519).
402268620801 is a wasteful number, since it uses less digits than its factorization.
402268620801 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 235658815.
The product of its (nonzero) digits is 73728, while the sum is 39.
The spelling of 402268620801 in words is "four hundred two billion, two hundred sixty-eight million, six hundred twenty thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •