Base | Representation |
---|---|
bin | 10001110010100010… |
… | …010000010000000000 |
3 | 1211022012202021002221 |
4 | 101302202100100000 |
5 | 303104432420024 |
6 | 12435230220424 |
7 | 1244231441200 |
oct | 216242202000 |
9 | 54265667087 |
10 | 19101451264 |
11 | 81122a9065 |
12 | 3851054714 |
13 | 1a5549b9ac |
14 | cd2c26400 |
15 | 76be293e4 |
hex | 472890400 |
19101451264 has 99 divisors (see below), whose sum is σ = 44490519453. Its totient is φ = 8173068288.
The previous prime is 19101451253. The next prime is 19101451267. The reversal of 19101451264 is 46215410191.
The square root of 19101451264 is 138208.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 553190400 + 18548260864 = 23520^2 + 136192^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (19101451267) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 30958284 + ... + 30958900.
Almost surely, 219101451264 is an apocalyptic number.
19101451264 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
19101451264 is the 138208-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 19101451264
19101451264 is an abundant number, since it is smaller than the sum of its proper divisors (25389068189).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
19101451264 is an frugal number, since it uses more digits than its factorization.
19101451264 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1268 (or 626 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 34.
The spelling of 19101451264 in words is "nineteen billion, one hundred one million, four hundred fifty-one thousand, two hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.744 sec. • engine limits •