Base | Representation |
---|---|
bin | 1101000111100001001… |
… | …1011010001111010010 |
3 | 210112200111022010222001 |
4 | 3101320103122033102 |
5 | 12143012300403042 |
6 | 251305531104214 |
7 | 22165355643400 |
oct | 3217023321722 |
9 | 715614263861 |
10 | 225356653522 |
11 | 87633a57300 |
12 | 378135a206a |
13 | 183356cb180 |
14 | ac9b988470 |
15 | 5cde5e6bb7 |
hex | 34784da3d2 |
225356653522 has 144 divisors (see below), whose sum is σ = 468127356480. Its totient is φ = 80584701120.
The previous prime is 225356653517. The next prime is 225356653531.
225356653522 is nontrivially palindromic in base 10.
225356653522 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 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 71 ways as a sum of consecutive naturals, for example, 27589483 + ... + 27597649.
It is an arithmetic number, because the mean of its divisors is an integer number (3250884420).
Almost surely, 2225356653522 is an apocalyptic number.
225356653522 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
225356653522 is an abundant number, since it is smaller than the sum of its proper divisors (242770702958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
225356653522 is a wasteful number, since it uses less digits than its factorization.
225356653522 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8397 (or 8379 counting only the distinct ones).
The product of its digits is 3240000, while the sum is 46.
It can be divided in two parts, 225356 and 653522, that added together give a palindrome (878878).
The spelling of 225356653522 in words is "two hundred twenty-five billion, three hundred fifty-six million, six hundred fifty-three thousand, five hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •