Base | Representation |
---|---|
bin | 10011010000001001101… |
… | …010101110100111011101 |
3 | 11200110220222201102120202 |
4 | 103100021222232213131 |
5 | 133134012100414401 |
6 | 2451441113153245 |
7 | 164404321332314 |
oct | 23201152564735 |
9 | 4613828642522 |
10 | 1323012123101 |
11 | 4700a4941949 |
12 | 1944aa0bb825 |
13 | 979b483c626 |
14 | 4806991127b |
15 | 2463432c06b |
hex | 13409aae9dd |
1323012123101 has 8 divisors (see below), whose sum is σ = 1330787318784. Its totient is φ = 1315259432640.
The previous prime is 1323012123079. The next prime is 1323012123137. The reversal of 1323012123101 is 1013212103231.
It is a happy number.
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 1323012123101 - 210 = 1323012122077 is a prime.
It is a super-2 number, since 2×13230121231012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1323012123161) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5508380 + ... + 5743541.
It is an arithmetic number, because the mean of its divisors is an integer number (166348414848).
Almost surely, 21323012123101 is an apocalyptic number.
It is an amenable number.
1323012123101 is a deficient number, since it is larger than the sum of its proper divisors (7775195683).
1323012123101 is a wasteful number, since it uses less digits than its factorization.
1323012123101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11252611.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 1323012123101 its reverse (1013212103231), we get a palindrome (2336224226332).
The spelling of 1323012123101 in words is "one trillion, three hundred twenty-three billion, twelve million, one hundred twenty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •