Base | Representation |
---|---|
bin | 1110101111010001001… |
… | …0010110101100001010 |
3 | 220012120101210202012110 |
4 | 3223310102112230022 |
5 | 13122031334233102 |
6 | 312153235123150 |
7 | 24202460131533 |
oct | 3536422265412 |
9 | 805511722173 |
10 | 253206555402 |
11 | 98425554839 |
12 | 410a64434b6 |
13 | 1ab534b4458 |
14 | c38062568a |
15 | 68be5ae86c |
hex | 3af4496b0a |
253206555402 has 8 divisors (see below), whose sum is σ = 506413110816. Its totient is φ = 84402185132.
The previous prime is 253206555397. The next prime is 253206555451. The reversal of 253206555402 is 204555602352.
253206555402 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
253206555402 is an admirable number.
It is a super-2 number, since 2×2532065554022 (a number of 24 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21100546278 + ... + 21100546289.
It is an arithmetic number, because the mean of its divisors is an integer number (63301638852).
Almost surely, 2253206555402 is an apocalyptic number.
253206555402 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
253206555402 is a wasteful number, since it uses less digits than its factorization.
253206555402 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42201092572.
The product of its (nonzero) digits is 360000, while the sum is 39.
The spelling of 253206555402 in words is "two hundred fifty-three billion, two hundred six million, five hundred fifty-five thousand, four hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •