Base | Representation |
---|---|
bin | 11000101101001000… |
… | …01111010101101010 |
3 | 1021020100121122101211 |
4 | 30112210033111222 |
5 | 204130424010100 |
6 | 10032042503334 |
7 | 646452616051 |
oct | 142644172552 |
9 | 37210548354 |
10 | 13263500650 |
11 | 569699a394 |
12 | 26a1b04b4a |
13 | 1334b6044a |
14 | 8db75b398 |
15 | 5296511ba |
hex | 31690f56a |
13263500650 has 48 divisors (see below), whose sum is σ = 24969544704. Its totient is φ = 5241284480.
The previous prime is 13263500641. The next prime is 13263500671. The reversal of 13263500650 is 5600536231.
13263500650 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 23 ways as a sum of consecutive naturals, for example, 2045814 + ... + 2052286.
It is an arithmetic number, because the mean of its divisors is an integer number (520198848).
Almost surely, 213263500650 is an apocalyptic number.
13263500650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13263500650 is a deficient number, since it is larger than the sum of its proper divisors (11706044054).
13263500650 is a wasteful number, since it uses less digits than its factorization.
13263500650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6975 (or 6970 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 31.
The spelling of 13263500650 in words is "thirteen billion, two hundred sixty-three million, five hundred thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •