Base | Representation |
---|---|
bin | 10111011101110010100010… |
… | …100010110001010001100001 |
3 | 111112102000220211211122102122 |
4 | 113131302202202301101201 |
5 | 102011331102002241001 |
6 | 1003254234155554025 |
7 | 30511053516301133 |
oct | 2735624242612141 |
9 | 445360824748378 |
10 | 103202201212001 |
11 | 2a979898121221 |
12 | b6a934045b915 |
13 | 4577c0602c208 |
14 | 1b6b0282a1053 |
15 | bde7d5843b1b |
hex | 5ddca28b1461 |
103202201212001 has 8 divisors (see below), whose sum is σ = 109274186345184. Its totient is φ = 97130356902720.
The previous prime is 103202201211973. The next prime is 103202201212043. The reversal of 103202201212001 is 100212102202301.
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 103202201212001 - 222 = 103202197017697 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103202201212091) 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, 33695315 + ... + 36630296.
It is an arithmetic number, because the mean of its divisors is an integer number (13659273293148).
Almost surely, 2103202201212001 is an apocalyptic number.
It is an amenable number.
103202201212001 is a deficient number, since it is larger than the sum of its proper divisors (6071985133183).
103202201212001 is an equidigital number, since it uses as much as digits as its factorization.
103202201212001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70411951.
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 103202201212001 its reverse (100212102202301), we get a palindrome (203414303414302).
The spelling of 103202201212001 in words is "one hundred three trillion, two hundred two billion, two hundred one million, two hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •