Base | Representation |
---|---|
bin | 10111011111100001011000… |
… | …001010000101101000100101 |
3 | 111112211102002221012221021212 |
4 | 113133201120022011220211 |
5 | 102020303320322441401 |
6 | 1003425035404521205 |
7 | 30522465650043350 |
oct | 2737413012055045 |
9 | 445742087187255 |
10 | 103321212312101 |
11 | 2aa153098541a3 |
12 | b708414b50205 |
13 | 45861c13948c4 |
14 | 1b72ab8149297 |
15 | be294daabdbb |
hex | 5df858285a25 |
103321212312101 has 8 divisors (see below), whose sum is σ = 118081465434240. Its totient is φ = 88560979173648.
The previous prime is 103321212311969. The next prime is 103321212312133. The reversal of 103321212312101 is 101213212123301.
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 103321212312101 - 222 = 103321208117797 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103321212312191) 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, 8521535 + ... + 16711043.
It is an arithmetic number, because the mean of its divisors is an integer number (14760183179280).
Almost surely, 2103321212312101 is an apocalyptic number.
It is an amenable number.
103321212312101 is a deficient number, since it is larger than the sum of its proper divisors (14760253122139).
103321212312101 is an equidigital number, since it uses as much as digits as its factorization.
103321212312101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9991843.
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 103321212312101 its reverse (101213212123301), we get a palindrome (204534424435402).
The spelling of 103321212312101 in words is "one hundred three trillion, three hundred twenty-one billion, two hundred twelve million, three hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •