Base | Representation |
---|---|
bin | 11000110000110001… |
… | …01011111001011010 |
3 | 1021022111001111202120 |
4 | 30120120223321122 |
5 | 204211232320310 |
6 | 10035053042110 |
7 | 650303234154 |
oct | 143030537132 |
9 | 37274044676 |
10 | 13294026330 |
11 | 5702149822 |
12 | 26b0186336 |
13 | 133b28a790 |
14 | 901825ad4 |
15 | 52c180b70 |
hex | 31862be5a |
13294026330 has 32 divisors (see below), whose sum is σ = 34359945984. Its totient is φ = 3272375616.
The previous prime is 13294026307. The next prime is 13294026373. The reversal of 13294026330 is 3362049231.
13294026330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×132940263302 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13294026291 and 13294026300.
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 15 ways as a sum of consecutive naturals, for example, 17043234 + ... + 17044013.
It is an arithmetic number, because the mean of its divisors is an integer number (1073748312).
Almost surely, 213294026330 is an apocalyptic number.
13294026330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13294026330 is an abundant number, since it is smaller than the sum of its proper divisors (21065919654).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13294026330 is a wasteful number, since it uses less digits than its factorization.
13294026330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34087270.
The product of its (nonzero) digits is 23328, while the sum is 33.
The spelling of 13294026330 in words is "thirteen billion, two hundred ninety-four million, twenty-six thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •