Base | Representation |
---|---|
bin | 1011101101001100111… |
… | …11010111110110100110 |
3 | 1102110012202200021022000 |
4 | 11312212133113312212 |
5 | 23042224122404200 |
6 | 504440225550130 |
7 | 41026341536115 |
oct | 5664637276646 |
9 | 1373182607260 |
10 | 402225200550 |
11 | 145645704518 |
12 | 65b544a5346 |
13 | 2bc11654264 |
14 | 1567991dc7c |
15 | a6e1e42300 |
hex | 5da67d7da6 |
402225200550 has 96 divisors (see below), whose sum is σ = 1115694543360. Its totient is φ = 106549668000.
The previous prime is 402225200527. The next prime is 402225200551. The reversal of 402225200550 is 55002522204.
402225200550 is a `hidden beast` number, since 40 + 2 + 22 + 52 + 0 + 0 + 550 = 666.
It is a super-2 number, since 2×4022252005502 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402225200551) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 782722 + ... + 1190421.
It is an arithmetic number, because the mean of its divisors is an integer number (11621818160).
Almost surely, 2402225200550 is an apocalyptic number.
402225200550 is an abundant number, since it is smaller than the sum of its proper divisors (713469342810).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
402225200550 is a wasteful number, since it uses less digits than its factorization.
402225200550 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1973315 (or 1973304 counting only the distinct ones).
The product of its (nonzero) digits is 8000, while the sum is 27.
Adding to 402225200550 its reverse (55002522204), we get a palindrome (457227722754).
The spelling of 402225200550 in words is "four hundred two billion, two hundred twenty-five million, two hundred thousand, five hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •