Base | Representation |
---|---|
bin | 101101101000001000100000… |
… | …0010100111010000100111011 |
3 | 1221122000201200212202012121111 |
4 | 1123100101000110322010323 |
5 | 410101023311311330021 |
6 | 3541325015134421151 |
7 | 150351600263306536 |
oct | 13320210024720473 |
9 | 1848021625665544 |
10 | 401340003230011 |
11 | 106974380a0265a |
12 | 3901a46b0617b7 |
13 | 142c327a2889a1 |
14 | 7116d619a1a1d |
15 | 315eb93e778e1 |
hex | 16d044053a13b |
401340003230011 has 4 divisors (see below), whose sum is σ = 401643818525224. Its totient is φ = 401036187934800.
The previous prime is 401340003229981. The next prime is 401340003230039. The reversal of 401340003230011 is 110032300043104.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 401340003230011 - 29 = 401340003229499 is a prime.
It is a super-2 number, since 2×4013400032300112 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (401340003234011) 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, 151907645625 + ... + 151907648266.
It is an arithmetic number, because the mean of its divisors is an integer number (100410954631306).
Almost surely, 2401340003230011 is an apocalyptic number.
401340003230011 is a deficient number, since it is larger than the sum of its proper divisors (303815295213).
401340003230011 is a wasteful number, since it uses less digits than its factorization.
401340003230011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 303815295212.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 401340003230011 its reverse (110032300043104), we get a palindrome (511372303273115).
The spelling of 401340003230011 in words is "four hundred one trillion, three hundred forty billion, three million, two hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •