Base | Representation |
---|---|
bin | 1001001000011101101100… |
… | …0010111100000011001111 |
3 | 1022112220121111110112100022 |
4 | 2102013123002330003033 |
5 | 2304002443432120221 |
6 | 33204440011452355 |
7 | 2054303450646221 |
oct | 222073302740317 |
9 | 38486544415308 |
10 | 10041013551311 |
11 | 3221408421176 |
12 | 11620231570bb |
13 | 57ab2c1b1092 |
14 | 269db8174411 |
15 | 1262ca8d64ab |
hex | 921db0bc0cf |
10041013551311 has 8 divisors (see below), whose sum is σ = 10133201010240. Its totient is φ = 9948827330208.
The previous prime is 10041013551281. The next prime is 10041013551329. The reversal of 10041013551311 is 11315531014001.
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 10041013551311 - 210 = 10041013550287 is a prime.
It is a super-2 number, since 2×100410135513112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10041013541311) 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, 26990810 + ... + 27360296.
It is an arithmetic number, because the mean of its divisors is an integer number (1266650126280).
Almost surely, 210041013551311 is an apocalyptic number.
10041013551311 is a deficient number, since it is larger than the sum of its proper divisors (92187458929).
10041013551311 is a wasteful number, since it uses less digits than its factorization.
10041013551311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 618913.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 10041013551311 its reverse (11315531014001), we get a palindrome (21356544565312).
The spelling of 10041013551311 in words is "ten trillion, forty-one billion, thirteen million, five hundred fifty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •