Base | Representation |
---|---|
bin | 11101001011011111100… |
… | …11011000101100001101 |
3 | 10112211220010122200202112 |
4 | 32211233303120230031 |
5 | 112411312344341141 |
6 | 2044331200233405 |
7 | 132302303630216 |
oct | 16455763305415 |
9 | 3484803580675 |
10 | 1002603121421 |
11 | 357224362610 |
12 | 14238990b865 |
13 | 73711692485 |
14 | 3675205c40d |
15 | 1b1300617eb |
hex | e96fcd8b0d |
1002603121421 has 16 divisors (see below), whose sum is σ = 1102524825600. Its totient is φ = 904160886000.
The previous prime is 1002603121411. The next prime is 1002603121427. The reversal of 1002603121421 is 1241213062001.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1002603121421 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1002603121427) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 774500 + ... + 1614018.
It is an arithmetic number, because the mean of its divisors is an integer number (68907801600).
Almost surely, 21002603121421 is an apocalyptic number.
1002603121421 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1002603121421 is a deficient number, since it is larger than the sum of its proper divisors (99921704179).
1002603121421 is a wasteful number, since it uses less digits than its factorization.
1002603121421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 840400.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1002603121421 its reverse (1241213062001), we get a palindrome (2243816183422).
The spelling of 1002603121421 in words is "one trillion, two billion, six hundred three million, one hundred twenty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •