Base | Representation |
---|---|
bin | 11101110001110111000… |
… | …11001101001001110111 |
3 | 10121211001122202122021121 |
4 | 32320323203031021313 |
5 | 113231004013113421 |
6 | 2102015134524411 |
7 | 133631611362223 |
oct | 16707343151167 |
9 | 3554048678247 |
10 | 1023201301111 |
11 | 364a34506910 |
12 | 146378066707 |
13 | 75644c79292 |
14 | 37747975783 |
15 | 1b93858ad41 |
hex | ee3b8cd277 |
1023201301111 has 8 divisors (see below), whose sum is σ = 1118870959248. Its totient is φ = 927973536000.
The previous prime is 1023201301039. The next prime is 1023201301147. The reversal of 1023201301111 is 1111031023201.
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 1023201301111 - 27 = 1023201300983 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 (1023201301211) 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, 110468410 + ... + 110477671.
It is an arithmetic number, because the mean of its divisors is an integer number (139858869906).
Almost surely, 21023201301111 is an apocalyptic number.
1023201301111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1023201301111 is a deficient number, since it is larger than the sum of its proper divisors (95669658137).
1023201301111 is a wasteful number, since it uses less digits than its factorization.
1023201301111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 220946513.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 1023201301111 its reverse (1111031023201), we get a palindrome (2134232324312).
The spelling of 1023201301111 in words is "one trillion, twenty-three billion, two hundred one million, three hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •