Base | Representation |
---|---|
bin | 10110111110010111… |
… | …01101010110111011 |
3 | 1011211121012112110122 |
4 | 23133023231112323 |
5 | 200230041320011 |
6 | 5355531203455 |
7 | 614441005514 |
oct | 133713552673 |
9 | 34747175418 |
10 | 12334323131 |
11 | 525a449589 |
12 | 24828a658b |
13 | 12174bc270 |
14 | 8501a7a0b |
15 | 4c2cae3db |
hex | 2df2ed5bb |
12334323131 has 8 divisors (see below), whose sum is σ = 13470204384. Its totient is φ = 11225168640.
The previous prime is 12334323103. The next prime is 12334323143. The reversal of 12334323131 is 13132343321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12334323131 - 210 = 12334322107 is a prime.
It is a super-2 number, since 2×123343231312 (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 12334323131.
It is not an unprimeable number, because it can be changed into a prime (12334323031) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6680726 + ... + 6682571.
It is an arithmetic number, because the mean of its divisors is an integer number (1683775548).
Almost surely, 212334323131 is an apocalyptic number.
12334323131 is a deficient number, since it is larger than the sum of its proper divisors (1135881253).
12334323131 is a wasteful number, since it uses less digits than its factorization.
12334323131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13363381.
The product of its digits is 3888, while the sum is 26.
Adding to 12334323131 its reverse (13132343321), we get a palindrome (25466666452).
The spelling of 12334323131 in words is "twelve billion, three hundred thirty-four million, three hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •