Base | Representation |
---|---|
bin | 1001001110010110101001… |
… | …0010111011100010100111 |
3 | 1022220120210102202021201021 |
4 | 2103211222102323202213 |
5 | 2312132211442230343 |
6 | 33323132440512011 |
7 | 2064515125132525 |
oct | 223455222734247 |
9 | 38816712667637 |
10 | 10142201133223 |
11 | 3260313151125 |
12 | 117976277b607 |
13 | 587536a578c3 |
14 | 270c56c11315 |
15 | 128c4e0070ed |
hex | 9396a4bb8a7 |
10142201133223 has 8 divisors (see below), whose sum is σ = 10204857923040. Its totient is φ = 10079724134400.
The previous prime is 10142201133199. The next prime is 10142201133277. The reversal of 10142201133223 is 32233110224101.
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 10142201133223 - 25 = 10142201133191 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 (10142201139223) 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 7 ways as a sum of consecutive naturals, for example, 44834578 + ... + 45060223.
It is an arithmetic number, because the mean of its divisors is an integer number (1275607240380).
Almost surely, 210142201133223 is an apocalyptic number.
10142201133223 is a deficient number, since it is larger than the sum of its proper divisors (62656789817).
10142201133223 is an equidigital number, since it uses as much as digits as its factorization.
10142201133223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89895497.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 10142201133223 its reverse (32233110224101), we get a palindrome (42375311357324).
The spelling of 10142201133223 in words is "ten trillion, one hundred forty-two billion, two hundred one million, one hundred thirty-three thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •