Base | Representation |
---|---|
bin | 11100010110011000… |
… | …10010100111100100 |
3 | 1110021201102002011211 |
4 | 32023030102213210 |
5 | 222132330010100 |
6 | 10554140441204 |
7 | 1046112125164 |
oct | 161314224744 |
9 | 43251362154 |
10 | 15220156900 |
11 | 6500422173 |
12 | 2b49249204 |
13 | 1587340000 |
14 | a455725a4 |
15 | 5e13011ba |
hex | 38b3129e4 |
15220156900 has 135 divisors (see below), whose sum is σ = 36276806391. Its totient is φ = 5542767360.
The previous prime is 15220156841. The next prime is 15220156927. The reversal of 15220156900 is 965102251.
The square root of 15220156900 is 123370.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 22 ways, for example, as 6550312356 + 8669844544 = 80934^2 + 93112^2 .
It is a super-2 number, since 2×152201569002 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 208495264 + ... + 208495336.
Almost surely, 215220156900 is an apocalyptic number.
15220156900 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
15220156900 is the 123370-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 15220156900
15220156900 is an abundant number, since it is smaller than the sum of its proper divisors (21056649491).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15220156900 is an frugal number, since it uses more digits than its factorization.
15220156900 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 212 (or 93 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 15220156900 in words is "fifteen billion, two hundred twenty million, one hundred fifty-six thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •