Base | Representation |
---|---|
bin | 1101000110010111010… |
… | …1000001000001110010 |
3 | 210111212220001200020200 |
4 | 3101211311001001302 |
5 | 12141343423233200 |
6 | 251215055420030 |
7 | 22154603232321 |
oct | 3214565010162 |
9 | 714786050220 |
10 | 225046696050 |
11 | 87494aa1700 |
12 | 37747824616 |
13 | 182b6424c97 |
14 | ac6c7420b8 |
15 | 5cc22bc800 |
hex | 3465d41072 |
225046696050 has 486 divisors, whose sum is σ = 708024083949. Its totient is φ = 51202324800.
The previous prime is 225046696027. The next prime is 225046696067. The reversal of 225046696050 is 50696640522.
It is a happy number.
225046696050 is a `hidden beast` number, since 2 + 2 + 50 + 466 + 96 + 0 + 50 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 220545762129 + 4500933921 = 469623^2 + 67089^2 .
It is an ABA number since it can be written as A⋅BA, here for A=2, B=335445.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 225046695987 and 225046696005.
It is an unprimeable number.
It is a polite number, since it can be written in 242 ways as a sum of consecutive naturals, for example, 2103240097 + ... + 2103240203.
Almost surely, 2225046696050 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 225046696050
225046696050 is an abundant number, since it is smaller than the sum of its proper divisors (482977387899).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
225046696050 is a wasteful number, since it uses less digits than its factorization.
225046696050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 292 (or 147 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 45.
The spelling of 225046696050 in words is "two hundred twenty-five billion, forty-six million, six hundred ninety-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •