Base | Representation |
---|---|
bin | 10011000101010111… |
… | …00111000110010110 |
3 | 222110000210001121000 |
4 | 21202223213012112 |
5 | 131440324042402 |
6 | 4412353204130 |
7 | 511615413546 |
oct | 114253470626 |
9 | 28400701530 |
10 | 10245534102 |
11 | 4388378461 |
12 | 1b9b260646 |
13 | c7382821b |
14 | 6d29d9326 |
15 | 3ee70dc1c |
hex | 262ae7196 |
10245534102 has 16 divisors (see below), whose sum is σ = 22767853680. Its totient is φ = 3415178016.
The previous prime is 10245534043. The next prime is 10245534107. The reversal of 10245534102 is 20143554201.
10245534102 is a `hidden beast` number, since 1 + 0 + 2 + 4 + 553 + 4 + 102 = 666.
10245534102 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10245534107) 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, 94866003 + ... + 94866110.
It is an arithmetic number, because the mean of its divisors is an integer number (1422990855).
Almost surely, 210245534102 is an apocalyptic number.
10245534102 is an abundant number, since it is smaller than the sum of its proper divisors (12522319578).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10245534102 is a wasteful number, since it uses less digits than its factorization.
10245534102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189732124 (or 189732118 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
The spelling of 10245534102 in words is "ten billion, two hundred forty-five million, five hundred thirty-four thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •