Base | Representation |
---|---|
bin | 10100101011110010010… |
… | …100010111100000101001 |
3 | 12000212220010120211010211 |
4 | 110223302110113200221 |
5 | 141242014041230004 |
6 | 3004552334141121 |
7 | 204456506014165 |
oct | 24536224274051 |
9 | 5025803524124 |
10 | 1421404633129 |
11 | 4a88a594aa38 |
12 | 1ab5896517a1 |
13 | a40652c3070 |
14 | 4cb2128bca5 |
15 | 26e92388504 |
hex | 14af2517829 |
1421404633129 has 16 divisors (see below), whose sum is σ = 1580453683200. Its totient is φ = 1269474799680.
The previous prime is 1421404633127. The next prime is 1421404633147. The reversal of 1421404633129 is 9213364041241.
It is a cyclic number.
It is not a de Polignac number, because 1421404633129 - 21 = 1421404633127 is a prime.
It is a super-2 number, since 2×14214046331292 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1421404633091 and 1421404633100.
It is not an unprimeable number, because it can be changed into a prime (1421404633123) 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 15 ways as a sum of consecutive naturals, for example, 1566519 + ... + 2301475.
It is an arithmetic number, because the mean of its divisors is an integer number (98778355200).
Almost surely, 21421404633129 is an apocalyptic number.
It is an amenable number.
1421404633129 is a deficient number, since it is larger than the sum of its proper divisors (159049050071).
1421404633129 is a wasteful number, since it uses less digits than its factorization.
1421404633129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 739800.
The product of its (nonzero) digits is 124416, while the sum is 40.
The spelling of 1421404633129 in words is "one trillion, four hundred twenty-one billion, four hundred four million, six hundred thirty-three thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •