Base | Representation |
---|---|
bin | 100011110001011110… |
… | …100110001100110011 |
3 | 10200010221012102211222 |
4 | 203301132212030303 |
5 | 1112131213140321 |
6 | 25351254255255 |
7 | 2526601456415 |
oct | 436136461463 |
9 | 120127172758 |
10 | 38411068211 |
11 | 1532105707a |
12 | 753b95752b |
13 | 3811b23639 |
14 | 1c055589b5 |
15 | eec2723ab |
hex | 8f17a6333 |
38411068211 has 6 divisors (see below), whose sum is σ = 40539105612. Its totient is φ = 36389432700.
The previous prime is 38411068193. The next prime is 38411068229. The reversal of 38411068211 is 11286011483.
It is an interprime number because it is at equal distance from previous prime (38411068193) and next prime (38411068229).
It is not a de Polignac number, because 38411068211 - 222 = 38406873907 is a prime.
It is a super-2 number, since 2×384110682112 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (38411068291) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 53200565 + ... + 53201286.
It is an arithmetic number, because the mean of its divisors is an integer number (6756517602).
Almost surely, 238411068211 is an apocalyptic number.
38411068211 is a deficient number, since it is larger than the sum of its proper divisors (2128037401).
38411068211 is a wasteful number, since it uses less digits than its factorization.
38411068211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106401889 (or 106401870 counting only the distinct ones).
The product of its (nonzero) digits is 9216, while the sum is 35.
Adding to 38411068211 its reverse (11286011483), we get a palindrome (49697079694).
The spelling of 38411068211 in words is "thirty-eight billion, four hundred eleven million, sixty-eight thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •