Base | Representation |
---|---|
bin | 1101000110011011011… |
… | …1010010111110100000 |
3 | 210111221002202102022000 |
4 | 3101212313102332200 |
5 | 12141412400233242 |
6 | 251220520044000 |
7 | 22155204016341 |
oct | 3214667227640 |
9 | 714832672260 |
10 | 225064071072 |
11 | 874a3889825 |
12 | 37751603600 |
13 | 182b9bc9669 |
14 | ac70b860c8 |
15 | 5cc3aa0a4c |
hex | 3466dd2fa0 |
225064071072 has 48 divisors (see below), whose sum is σ = 656436876480. Its totient is φ = 75021356736.
The previous prime is 225064071007. The next prime is 225064071077. The reversal of 225064071072 is 270170460522.
It is a happy number.
225064071072 is a `hidden beast` number, since 2 + 2 + 5 + 0 + 640 + 7 + 1 + 0 + 7 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-4 number, since 4×2250640710724 (a number of 47 digits) contains 4444 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (225064071077) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130244548 + ... + 130246275.
It is an arithmetic number, because the mean of its divisors is an integer number (13675768260).
Almost surely, 2225064071072 is an apocalyptic number.
It is an amenable number.
225064071072 is an abundant number, since it is smaller than the sum of its proper divisors (431372805408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
225064071072 is a wasteful number, since it uses less digits than its factorization.
225064071072 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 260490842 (or 260490828 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 36.
The spelling of 225064071072 in words is "two hundred twenty-five billion, sixty-four million, seventy-one thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •