Base | Representation |
---|---|
bin | 10011110011101100… |
… | …00001111010010010 |
3 | 1000110010000100111022 |
4 | 21321312001322102 |
5 | 133234320010310 |
6 | 4515114315442 |
7 | 524344465331 |
oct | 117166017222 |
9 | 30403010438 |
10 | 10634141330 |
11 | 456777185a |
12 | 2089428b82 |
13 | 10061ab027 |
14 | 72c475d18 |
15 | 4238c1a55 |
hex | 279d81e92 |
10634141330 has 16 divisors (see below), whose sum is σ = 19145377944. Its totient is φ = 4252784640.
The previous prime is 10634141311. The next prime is 10634141351. The reversal of 10634141330 is 3314143601.
10634141330 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 4867713361 + 5766427969 = 69769^2 + 75937^2 .
It is a super-2 number, since 2×106341413302 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10634141330.
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, 56561 + ... + 156420.
Almost surely, 210634141330 is an apocalyptic number.
10634141330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10634141330 is a deficient number, since it is larger than the sum of its proper divisors (8511236614).
10634141330 is a wasteful number, since it uses less digits than its factorization.
10634141330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217981.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 10634141330 its reverse (3314143601), we get a palindrome (13948284931).
The spelling of 10634141330 in words is "ten billion, six hundred thirty-four million, one hundred forty-one thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •