Base | Representation |
---|---|
bin | 10111101001001010… |
… | …00110001110100110 |
3 | 1012202121200110100012 |
4 | 23310211012032212 |
5 | 201443441101014 |
6 | 5455313250222 |
7 | 626360161634 |
oct | 136445061646 |
9 | 35677613305 |
10 | 12693300134 |
11 | 5424045299 |
12 | 2562b63972 |
13 | 12739994a8 |
14 | 885b30354 |
15 | 4e456cc3e |
hex | 2f49463a6 |
12693300134 has 16 divisors (see below), whose sum is σ = 19188867600. Its totient is φ = 6297068064.
The previous prime is 12693300131. The next prime is 12693300143. The reversal of 12693300134 is 43100339621.
12693300134 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×126933001342 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 12693300134.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12693300131) by changing a digit.
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, 461744 + ... + 488460.
It is an arithmetic number, because the mean of its divisors is an integer number (1199304225).
Almost surely, 212693300134 is an apocalyptic number.
12693300134 is a deficient number, since it is larger than the sum of its proper divisors (6495567466).
12693300134 is a wasteful number, since it uses less digits than its factorization.
12693300134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28567.
The product of its (nonzero) digits is 11664, while the sum is 32.
Adding to 12693300134 its reverse (43100339621), we get a palindrome (55793639755).
The spelling of 12693300134 in words is "twelve billion, six hundred ninety-three million, three hundred thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •