Base | Representation |
---|---|
bin | 10100101011100000010… |
… | …111010111101001100001 |
3 | 12000212010010211010110022 |
4 | 110223200113113221201 |
5 | 141240404434231431 |
6 | 3004502414243225 |
7 | 204446160564515 |
oct | 24534027275141 |
9 | 5025103733408 |
10 | 1421103430241 |
11 | 4a8760924830 |
12 | 1ab5047b6515 |
13 | a4017a938c1 |
14 | 4cad3284145 |
15 | 26e75bdd07b |
hex | 14ae05d7a61 |
1421103430241 has 16 divisors (see below), whose sum is σ = 1586553091200. Its totient is φ = 1262030716800.
The previous prime is 1421103430231. The next prime is 1421103430283. The reversal of 1421103430241 is 1420343011241.
It is a cyclic number.
It is not a de Polignac number, because 1421103430241 - 222 = 1421099235937 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1421103430241.
It is not an unprimeable number, because it can be changed into a prime (1421103430231) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8261636 + ... + 8431893.
It is an arithmetic number, because the mean of its divisors is an integer number (99159568200).
Almost surely, 21421103430241 is an apocalyptic number.
1421103430241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1421103430241 is a deficient number, since it is larger than the sum of its proper divisors (165449660959).
1421103430241 is a wasteful number, since it uses less digits than its factorization.
1421103430241 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16693720.
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 1421103430241 its reverse (1420343011241), we get a palindrome (2841446441482).
The spelling of 1421103430241 in words is "one trillion, four hundred twenty-one billion, one hundred three million, four hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •