Base | Representation |
---|---|
bin | 1001100010010100000101… |
… | …0011010010100110010100 |
3 | 1101010100220101200110122020 |
4 | 2120211001103102212110 |
5 | 2333242001322323432 |
6 | 34144443211533140 |
7 | 2131344550552455 |
oct | 230450123224624 |
9 | 41110811613566 |
10 | 10485110745492 |
11 | 338278a7401a9 |
12 | 121410245a1b0 |
13 | 5b0984693a16 |
14 | 2836a6b1912c |
15 | 132b1d83a22c |
hex | 989414d2994 |
10485110745492 has 48 divisors (see below), whose sum is σ = 25313585451840. Its totient is φ = 3373892075008.
The previous prime is 10485110745481. The next prime is 10485110745509. The reversal of 10485110745492 is 29454701158401.
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 15 ways as a sum of consecutive naturals, for example, 916638 + ... + 4670165.
It is an arithmetic number, because the mean of its divisors is an integer number (527366363580).
Almost surely, 210485110745492 is an apocalyptic number.
10485110745492 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10485110745492 is an abundant number, since it is smaller than the sum of its proper divisors (14828474706348).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10485110745492 is a wasteful number, since it uses less digits than its factorization.
10485110745492 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5592232 (or 5592230 counting only the distinct ones).
The product of its (nonzero) digits is 1612800, while the sum is 51.
The spelling of 10485110745492 in words is "ten trillion, four hundred eighty-five billion, one hundred ten million, seven hundred forty-five thousand, four hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •