Base | Representation |
---|---|
bin | 10100010101111001… |
… | …01011010001101001 |
3 | 1001012002222011201001 |
4 | 22022330223101221 |
5 | 134331300040142 |
6 | 5003404555001 |
7 | 534430533616 |
oct | 121274532151 |
9 | 31162864631 |
10 | 10921096297 |
11 | 46a4746321 |
12 | 2149552a61 |
13 | 105078c277 |
14 | 75861150d |
15 | 43dba55b7 |
hex | 28af2b469 |
10921096297 has 8 divisors (see below), whose sum is σ = 11155205376. Its totient is φ = 10687060032.
The previous prime is 10921096223. The next prime is 10921096321. The reversal of 10921096297 is 79269012901.
It is a happy number.
10921096297 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-10921096297 is a prime.
It is a super-2 number, since 2×109210962972 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10921096217) 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 7 ways as a sum of consecutive naturals, for example, 374788 + ... + 402874.
It is an arithmetic number, because the mean of its divisors is an integer number (1394400672).
Almost surely, 210921096297 is an apocalyptic number.
It is an amenable number.
10921096297 is a deficient number, since it is larger than the sum of its proper divisors (234109079).
10921096297 is an equidigital number, since it uses as much as digits as its factorization.
10921096297 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36407.
The product of its (nonzero) digits is 122472, while the sum is 46.
The spelling of 10921096297 in words is "ten billion, nine hundred twenty-one million, ninety-six thousand, two hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •