Base | Representation |
---|---|
bin | 11001010001110010… |
… | …00000111101001010 |
3 | 1022000210010000022100 |
4 | 30220321000331022 |
5 | 210243124433100 |
6 | 10122344134230 |
7 | 660205025655 |
oct | 145071007512 |
9 | 38023100270 |
10 | 13570936650 |
11 | 5834492627 |
12 | 2768a67376 |
13 | 1383762a3b |
14 | 92a50889c |
15 | 54662d400 |
hex | 328e40f4a |
13570936650 has 72 divisors (see below), whose sum is σ = 37636769664. Its totient is φ = 3502173600.
The previous prime is 13570936601. The next prime is 13570936669. The reversal of 13570936650 is 5663907531.
13570936650 is a `hidden beast` number, since 13 + 570 + 9 + 3 + 6 + 65 + 0 = 666.
13570936650 is digitally balanced in base 5, 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 (45).
It is a junction number, because it is equal to n+sod(n) for n = 13570936596 and 13570936605.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 472464 + ... + 500363.
It is an arithmetic number, because the mean of its divisors is an integer number (522732912).
Almost surely, 213570936650 is an apocalyptic number.
13570936650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13570936650 is an abundant number, since it is smaller than the sum of its proper divisors (24065833014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13570936650 is a wasteful number, since it uses less digits than its factorization.
13570936650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 972876 (or 972868 counting only the distinct ones).
The product of its (nonzero) digits is 510300, while the sum is 45.
The spelling of 13570936650 in words is "thirteen billion, five hundred seventy million, nine hundred thirty-six thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •