Base | Representation |
---|---|
bin | 111001010011000110100011… |
… | …001100011011101000111000 |
3 | 1020001021002112122121202021100 |
4 | 321103012203030123220320 |
5 | 231012242233122301402 |
6 | 2251543453543011400 |
7 | 104036332322162130 |
oct | 7123064314335070 |
9 | 1201232478552240 |
10 | 252001354103352 |
11 | 733281a08030a7 |
12 | 2431b673739b60 |
13 | aa7c8199451b9 |
14 | 4632d05883ac0 |
15 | 1e20200a0771c |
hex | e531a331ba38 |
252001354103352 has 96 divisors (see below), whose sum is σ = 780918617213280. Its totient is φ = 71915978338560.
The previous prime is 252001354103273. The next prime is 252001354103381. The reversal of 252001354103352 is 253301453100252.
252001354103352 is a `hidden beast` number, since 2 + 5 + 20 + 0 + 13 + 541 + 0 + 33 + 52 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 292654899 + ... + 293514722.
It is an arithmetic number, because the mean of its divisors is an integer number (8134568929305).
Almost surely, 2252001354103352 is an apocalyptic number.
It is an amenable number.
252001354103352 is an abundant number, since it is smaller than the sum of its proper divisors (528917263109928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
252001354103352 is a wasteful number, since it uses less digits than its factorization.
252001354103352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 586170493 (or 586170486 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 252001354103352 in words is "two hundred fifty-two trillion, one billion, three hundred fifty-four million, one hundred three thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •