Base | Representation |
---|---|
bin | 11000110110011100… |
… | …10000111010110010 |
3 | 1021102210121211021120 |
4 | 30123032100322302 |
5 | 204310424013114 |
6 | 10043513203110 |
7 | 651421643622 |
oct | 143316207262 |
9 | 37383554246 |
10 | 13341626034 |
11 | 5727000120 |
12 | 2704100496 |
13 | 13480b5499 |
14 | 907c96882 |
15 | 5314345a9 |
hex | 31b390eb2 |
13341626034 has 16 divisors (see below), whose sum is σ = 29109002400. Its totient is φ = 4042916960.
The previous prime is 13341626003. The next prime is 13341626057. The reversal of 13341626034 is 43062614331.
13341626034 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-3 number, since 3×133416260343 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 13341625986 and 13341626004.
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 7 ways as a sum of consecutive naturals, for example, 101072859 + ... + 101072990.
It is an arithmetic number, because the mean of its divisors is an integer number (1819312650).
Almost surely, 213341626034 is an apocalyptic number.
13341626034 is an abundant number, since it is smaller than the sum of its proper divisors (15767376366).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13341626034 is a wasteful number, since it uses less digits than its factorization.
13341626034 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 202145865.
The product of its (nonzero) digits is 31104, while the sum is 33.
The spelling of 13341626034 in words is "thirteen billion, three hundred forty-one million, six hundred twenty-six thousand, thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •