Base | Representation |
---|---|
bin | 11101010000010111101… |
… | …000010101011100100101 |
3 | 21010012022002200221000212 |
4 | 131100113220111130211 |
5 | 230414340413102401 |
6 | 4135330042545205 |
7 | 265151414523305 |
oct | 35202750253445 |
9 | 7105262627025 |
10 | 2010441144101 |
11 | 7056946829a5 |
12 | 285778808205 |
13 | 11777876a650 |
14 | 6d43d447605 |
15 | 37469979dbb |
hex | 1d417a15725 |
2010441144101 has 4 divisors (see below), whose sum is σ = 2165090462892. Its totient is φ = 1855791825312.
The previous prime is 2010441144079. The next prime is 2010441144113. The reversal of 2010441144101 is 1014411440102.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 791788530625 + 1218652613476 = 889825^2 + 1103926^2 .
It is a cyclic number.
It is not a de Polignac number, because 2010441144101 - 210 = 2010441143077 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 (2010441144601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 77324659376 + ... + 77324659401.
It is an arithmetic number, because the mean of its divisors is an integer number (541272615723).
Almost surely, 22010441144101 is an apocalyptic number.
It is an amenable number.
2010441144101 is a deficient number, since it is larger than the sum of its proper divisors (154649318791).
2010441144101 is a wasteful number, since it uses less digits than its factorization.
2010441144101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154649318790.
The product of its (nonzero) digits is 512, while the sum is 23.
Adding to 2010441144101 its reverse (1014411440102), we get a palindrome (3024852584203).
The spelling of 2010441144101 in words is "two trillion, ten billion, four hundred forty-one million, one hundred forty-four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •