Base | Representation |
---|---|
bin | 10011001000101001… |
… | …01110111011000110 |
3 | 222111221122002220212 |
4 | 21210110232323012 |
5 | 132014402410040 |
6 | 4415215555422 |
7 | 512401556261 |
oct | 114424567306 |
9 | 28457562825 |
10 | 10273091270 |
11 | 43a198a582 |
12 | 1ba852bb72 |
13 | c79456340 |
14 | 6d652dcd8 |
15 | 401d53d65 |
hex | 26452eec6 |
10273091270 has 64 divisors (see below), whose sum is σ = 20596101120. Its totient is φ = 3665271168.
The previous prime is 10273091263. The next prime is 10273091321. The reversal of 10273091270 is 7219037201.
10273091270 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 472049 + ... + 493331.
It is an arithmetic number, because the mean of its divisors is an integer number (321814080).
Almost surely, 210273091270 is an apocalyptic number.
10273091270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10273091270 is an abundant number, since it is smaller than the sum of its proper divisors (10323009850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10273091270 is a wasteful number, since it uses less digits than its factorization.
10273091270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21429.
The product of its (nonzero) digits is 5292, while the sum is 32.
The spelling of 10273091270 in words is "ten billion, two hundred seventy-three million, ninety-one thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •