Base | Representation |
---|---|
bin | 1101010101100011101… |
… | …0011001000111000100 |
3 | 210220102010001101212021 |
4 | 3111120322121013010 |
5 | 12223221443001100 |
6 | 253131503132524 |
7 | 22360634046532 |
oct | 3253072310704 |
9 | 726363041767 |
10 | 229124968900 |
11 | 89198087433 |
12 | 384a55a4144 |
13 | 187b6320899 |
14 | b13822d152 |
15 | 5e60354a1a |
hex | 3558e991c4 |
229124968900 has 81 divisors (see below), whose sum is σ = 502099606407. Its totient is φ = 90755832000.
The previous prime is 229124968879. The next prime is 229124968937. The reversal of 229124968900 is 9869421922.
The square root of 229124968900 is 478670.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 92485324996 + 136639643904 = 304114^2 + 369648^2 .
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 722791542 + ... + 722791858.
Almost surely, 2229124968900 is an apocalyptic number.
229124968900 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
229124968900 is the 478670-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 229124968900
229124968900 is an abundant number, since it is smaller than the sum of its proper divisors (272974637507).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
229124968900 is an equidigital number, since it uses as much as digits as its factorization.
229124968900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 950 (or 475 counting only the distinct ones).
The product of its (nonzero) digits is 1119744, while the sum is 52.
The spelling of 229124968900 in words is "two hundred twenty-nine billion, one hundred twenty-four million, nine hundred sixty-eight thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •