Base | Representation |
---|---|
bin | 1001010011011110001000… |
… | …1100010100101110010001 |
3 | 1100012222201002120200220222 |
4 | 2110313202030110232101 |
5 | 2320102232133410301 |
6 | 33431352032042425 |
7 | 2104046466235253 |
oct | 224674214245621 |
9 | 40188632520828 |
10 | 10230112013201 |
11 | 3294625595443 |
12 | 11927b7993415 |
13 | 592906acb292 |
14 | 2751d6495cd3 |
15 | 12b196c6a31b |
hex | 94de2314b91 |
10230112013201 has 8 divisors (see below), whose sum is σ = 10398508013184. Its totient is φ = 10062178006320.
The previous prime is 10230112013189. The next prime is 10230112013237. The reversal of 10230112013201 is 10231021103201.
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 10230112013201 - 234 = 10212932144017 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10230112013201.
It is not an unprimeable number, because it can be changed into a prime (10230112013281) 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, 115453625 + ... + 115542198.
It is an arithmetic number, because the mean of its divisors is an integer number (1299813501648).
Almost surely, 210230112013201 is an apocalyptic number.
It is an amenable number.
10230112013201 is a deficient number, since it is larger than the sum of its proper divisors (168395999983).
10230112013201 is an equidigital number, since it uses as much as digits as its factorization.
10230112013201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 230996551.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 10230112013201 its reverse (10231021103201), we get a palindrome (20461133116402).
The spelling of 10230112013201 in words is "ten trillion, two hundred thirty billion, one hundred twelve million, thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •