Base | Representation |
---|---|
bin | 1011001101010100010000… |
… | …1101110001100111011101 |
3 | 1121122002212022211112101101 |
4 | 2303111010031301213131 |
5 | 3103401313320242023 |
6 | 42113143331113101 |
7 | 2411223323363035 |
oct | 263250415614735 |
9 | 47562768745341 |
10 | 12323405634013 |
11 | 3a21366234391 |
12 | 1470437742791 |
13 | 6b5127642476 |
14 | 30865543c8c5 |
15 | 1658603171ad |
hex | b35443719dd |
12323405634013 has 4 divisors (see below), whose sum is σ = 12972005930560. Its totient is φ = 11674805337468.
The previous prime is 12323405633977. The next prime is 12323405634037. The reversal of 12323405634013 is 31043650432321.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12323405634013 - 29 = 12323405633501 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12323405634083) 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 3 ways as a sum of consecutive naturals, for example, 324300148245 + ... + 324300148282.
It is an arithmetic number, because the mean of its divisors is an integer number (3243001482640).
Almost surely, 212323405634013 is an apocalyptic number.
It is an amenable number.
12323405634013 is a deficient number, since it is larger than the sum of its proper divisors (648600296547).
12323405634013 is an equidigital number, since it uses as much as digits as its factorization.
12323405634013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 648600296546.
The product of its (nonzero) digits is 155520, while the sum is 37.
The spelling of 12323405634013 in words is "twelve trillion, three hundred twenty-three billion, four hundred five million, six hundred thirty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •