Base | Representation |
---|---|
bin | 1000000000101001001… |
… | …10001001110111011110 |
3 | 222022101210111001000210 |
4 | 10000110212021313132 |
5 | 14002124201000100 |
6 | 330234053433250 |
7 | 25612202516022 |
oct | 4002446116736 |
9 | 868353431023 |
10 | 275223453150 |
11 | a67a35119a8 |
12 | 4540b93b826 |
13 | 1cc519a17b9 |
14 | d46c724382 |
15 | 725c429c50 |
hex | 4014989dde |
275223453150 has 96 divisors (see below), whose sum is σ = 707059432800. Its totient is φ = 70798182400.
The previous prime is 275223453143. The next prime is 275223453163. The reversal of 275223453150 is 51354322572.
It is a junction number, because it is equal to n+sod(n) for n = 275223453099 and 275223453108.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 295936 + ... + 798764.
It is an arithmetic number, because the mean of its divisors is an integer number (7365202425).
Almost surely, 2275223453150 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 275223453150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (353529716400).
275223453150 is an abundant number, since it is smaller than the sum of its proper divisors (431835979650).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
275223453150 is a wasteful number, since it uses less digits than its factorization.
275223453150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 502974 (or 502969 counting only the distinct ones).
The product of its (nonzero) digits is 252000, while the sum is 39.
The spelling of 275223453150 in words is "two hundred seventy-five billion, two hundred twenty-three million, four hundred fifty-three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •