Base | Representation |
---|---|
bin | 10011101000000001… |
… | …10000110000001100 |
3 | 1000012021220001112121 |
4 | 21310000300300030 |
5 | 133034242310330 |
6 | 4501301142324 |
7 | 522045666361 |
oct | 116400606014 |
9 | 30167801477 |
10 | 10536291340 |
11 | 45175096a3 |
12 | 20606ba9a4 |
13 | cbbb3b023 |
14 | 71d484468 |
15 | 419ee417a |
hex | 274030c0c |
10536291340 has 12 divisors (see below), whose sum is σ = 22126211856. Its totient is φ = 4214516528.
The previous prime is 10536291313. The next prime is 10536291349. The reversal of 10536291340 is 4319263501.
It is a super-2 number, since 2×105362913402 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10536291296 and 10536291305.
It is not an unprimeable number, because it can be changed into a prime (10536291349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 263407264 + ... + 263407303.
It is an arithmetic number, because the mean of its divisors is an integer number (1843850988).
Almost surely, 210536291340 is an apocalyptic number.
10536291340 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10536291340 is an abundant number, since it is smaller than the sum of its proper divisors (11589920516).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10536291340 is a wasteful number, since it uses less digits than its factorization.
10536291340 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 526814576 (or 526814574 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 34.
The spelling of 10536291340 in words is "ten billion, five hundred thirty-six million, two hundred ninety-one thousand, three hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •