Base | Representation |
---|---|
bin | 11100000010011011100011… |
… | …000001111011110000011101 |
3 | 121011121112122121020100012211 |
4 | 130002123203001323300131 |
5 | 112130322112410044401 |
6 | 1114132521530000421 |
7 | 34655010146521165 |
oct | 3402334301736035 |
9 | 534545577210184 |
10 | 123312320003101 |
11 | 36322508994929 |
12 | 119b6906576111 |
13 | 53a63c0302728 |
14 | 22644c33c55a5 |
15 | e3c982e39951 |
hex | 7026e307bc1d |
123312320003101 has 16 divisors (see below), whose sum is σ = 125753028907968. Its totient is φ = 120894384582400.
The previous prime is 123312320003051. The next prime is 123312320003107. The reversal of 123312320003101 is 101300023213321.
It is a cyclic number.
It is not a de Polignac number, because 123312320003101 - 217 = 123312319872029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (123312320003107) 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 15 ways as a sum of consecutive naturals, for example, 1147667541 + ... + 1147774981.
It is an arithmetic number, because the mean of its divisors is an integer number (7859564306748).
Almost surely, 2123312320003101 is an apocalyptic number.
It is an amenable number.
123312320003101 is a deficient number, since it is larger than the sum of its proper divisors (2440708904867).
123312320003101 is a wasteful number, since it uses less digits than its factorization.
123312320003101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 213212.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 123312320003101 its reverse (101300023213321), we get a palindrome (224612343216422).
The spelling of 123312320003101 in words is "one hundred twenty-three trillion, three hundred twelve billion, three hundred twenty million, three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •