Base | Representation |
---|---|
bin | 1001001110010011101100… |
… | …1101100111001100010011 |
3 | 1022220111202101101000202201 |
4 | 2103210323031213030103 |
5 | 2312124102232210003 |
6 | 33322522222024031 |
7 | 2064456423655423 |
oct | 223447315471423 |
9 | 38814671330681 |
10 | 10141411210003 |
11 | 325aa48273117 |
12 | 1179582118017 |
13 | 58743c1c2508 |
14 | 270bbdd4a483 |
15 | 128c049c0b1d |
hex | 9393b367313 |
10141411210003 has 8 divisors (see below), whose sum is σ = 10675386141120. Its totient is φ = 9607457923560.
The previous prime is 10141411209997. The next prime is 10141411210031. The reversal of 10141411210003 is 30001211414101.
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 10141411210003 - 25 = 10141411209971 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is not an unprimeable number, because it can be changed into a prime (10141411210603) 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, 4444993 + ... + 6327778.
It is an arithmetic number, because the mean of its divisors is an integer number (1334423267640).
Almost surely, 210141411210003 is an apocalyptic number.
10141411210003 is a deficient number, since it is larger than the sum of its proper divisors (533974931117).
10141411210003 is a wasteful number, since it uses less digits than its factorization.
10141411210003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10822337.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 10141411210003 its reverse (30001211414101), we get a palindrome (40142622624104).
The spelling of 10141411210003 in words is "ten trillion, one hundred forty-one billion, four hundred eleven million, two hundred ten thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •