Base | Representation |
---|---|
bin | 10010101010011110… |
… | …11000111101010101 |
3 | 221212022110101022221 |
4 | 21111033120331111 |
5 | 131010112013331 |
6 | 4334140022341 |
7 | 503206604164 |
oct | 112517307525 |
9 | 27768411287 |
10 | 10020032341 |
11 | 4282057670 |
12 | 1b378319b1 |
13 | c38bb2527 |
14 | 6b0a993db |
15 | 3d9a18711 |
hex | 2553d8f55 |
10020032341 has 16 divisors (see below), whose sum is σ = 11190483648. Its totient is φ = 8895312000.
The previous prime is 10020032329. The next prime is 10020032369. The reversal of 10020032341 is 14323002001.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 10020032341 - 227 = 9885814613 is a prime.
It is a super-2 number, since 2×100200323412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020032371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19330 + ... + 142876.
It is an arithmetic number, because the mean of its divisors is an integer number (699405228).
Almost surely, 210020032341 is an apocalyptic number.
10020032341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10020032341 is a deficient number, since it is larger than the sum of its proper divisors (1170451307).
10020032341 is a wasteful number, since it uses less digits than its factorization.
10020032341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123732.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 10020032341 its reverse (14323002001), we get a palindrome (24343034342).
The spelling of 10020032341 in words is "ten billion, twenty million, thirty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •