Base | Representation |
---|---|
bin | 11101001001010011110… |
… | …01001000000011110001 |
3 | 10112201212101122011220201 |
4 | 32210221321020003301 |
5 | 112401412114033131 |
6 | 2044014541035201 |
7 | 132231242300455 |
oct | 16445171100361 |
9 | 3481771564821 |
10 | 1001430221041 |
11 | 356782286158 |
12 | 142100b55b01 |
13 | 73585698a93 |
14 | 36680384665 |
15 | 1b0b20ca761 |
hex | e929e480f1 |
1001430221041 has 8 divisors (see below), whose sum is σ = 1054172037600. Its totient is φ = 948691900800.
The previous prime is 1001430220997. The next prime is 1001430221047. The reversal of 1001430221041 is 1401220341001.
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 1001430221041 - 219 = 1001429696753 is a prime.
It is a super-2 number, since 2×10014302210412 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1001430221047) 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, 275635 + ... + 1441816.
It is an arithmetic number, because the mean of its divisors is an integer number (131771504700).
Almost surely, 21001430221041 is an apocalyptic number.
It is an amenable number.
1001430221041 is a deficient number, since it is larger than the sum of its proper divisors (52741816559).
1001430221041 is a wasteful number, since it uses less digits than its factorization.
1001430221041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1748159.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 1001430221041 its reverse (1401220341001), we get a palindrome (2402650562042).
The spelling of 1001430221041 in words is "one trillion, one billion, four hundred thirty million, two hundred twenty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •