Base | Representation |
---|---|
bin | 1001001100101010101010… |
… | …0011010100011011001001 |
3 | 1022210210222022002200022202 |
4 | 2103022222203110123021 |
5 | 2311143330341301301 |
6 | 33301540242325545 |
7 | 2062440611022023 |
oct | 223125243243311 |
9 | 38723868080282 |
10 | 10113214400201 |
11 | 3249a98972620 |
12 | 11740130598b5 |
13 | 584897596583 |
14 | 26d6a71a9013 |
15 | 12810433066b |
hex | 932aa8d46c9 |
10113214400201 has 8 divisors (see below), whose sum is σ = 11106641808000. Its totient is φ = 9132127705840.
The previous prime is 10113214400171. The next prime is 10113214400221. The reversal of 10113214400201 is 10200441231101.
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 10113214400201 - 218 = 10113214138057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10113214400221) 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, 3085176641 + ... + 3085179918.
It is an arithmetic number, because the mean of its divisors is an integer number (1388330226000).
Almost surely, 210113214400201 is an apocalyptic number.
10113214400201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10113214400201 is a deficient number, since it is larger than the sum of its proper divisors (993427407799).
10113214400201 is a wasteful number, since it uses less digits than its factorization.
10113214400201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6170356719.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 10113214400201 its reverse (10200441231101), we get a palindrome (20313655631302).
The spelling of 10113214400201 in words is "ten trillion, one hundred thirteen billion, two hundred fourteen million, four hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.032 sec. • engine limits •