Base | Representation |
---|---|
bin | 10100010101111100… |
… | …01110110100100100 |
3 | 1001012010201220000111 |
4 | 22022332032310210 |
5 | 134331401112121 |
6 | 5003421422404 |
7 | 534434152432 |
oct | 121276166444 |
9 | 31163656014 |
10 | 10921504036 |
11 | 46a49a46a3 |
12 | 214970aa04 |
13 | 10508a2a31 |
14 | 7586b9d52 |
15 | 43dc362e1 |
hex | 28af8ed24 |
10921504036 has 9 divisors (see below), whose sum is σ = 19112997841. Its totient is φ = 5460647512.
The previous prime is 10921504007. The next prime is 10921504037. The reversal of 10921504036 is 63040512901.
The square root of 10921504036 is 104506.
It is a perfect power (a square), and thus also a powerful number.
10921504036 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 3446864100 + 7474639936 = 58710^2 + 86456^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10921503989 and 10921504007.
It is not an unprimeable number, because it can be changed into a prime (10921504037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 2 ways as a sum of consecutive naturals, for example, 182886 + ... + 235138.
Almost surely, 210921504036 is an apocalyptic number.
10921504036 is the 104506-th square number.
It is an amenable number.
10921504036 is a deficient number, since it is larger than the sum of its proper divisors (8191493805).
10921504036 is an frugal number, since it uses more digits than its factorization.
10921504036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104510 (or 52255 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 31.
The spelling of 10921504036 in words is "ten billion, nine hundred twenty-one million, five hundred four thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •