Base | Representation |
---|---|
bin | 10100101011100110001… |
… | …111110011111000011001 |
3 | 12000212101000111200102012 |
4 | 110223212033303320121 |
5 | 141241110220041100 |
6 | 3004520301315305 |
7 | 204451466426513 |
oct | 24534617637031 |
9 | 5025330450365 |
10 | 1421202112025 |
11 | 4a88015a5923 |
12 | 1ab531865b35 |
13 | a40323653a7 |
14 | 4cb02410bb3 |
15 | 26e7e6d2135 |
hex | 14ae63f3e19 |
1421202112025 has 12 divisors (see below), whose sum is σ = 1838911950912. Its totient is φ = 1087528572240.
The previous prime is 1421202111977. The next prime is 1421202112061. The reversal of 1421202112025 is 5202112021241.
It is not a de Polignac number, because 1421202112025 - 226 = 1421135003161 is a prime.
It is a super-3 number, since 3×14212021120253 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a Duffinian number.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 1235827349 + ... + 1235828498.
It is an arithmetic number, because the mean of its divisors is an integer number (153242662576).
Almost surely, 21421202112025 is an apocalyptic number.
It is an amenable number.
1421202112025 is a deficient number, since it is larger than the sum of its proper divisors (417709838887).
1421202112025 is a wasteful number, since it uses less digits than its factorization.
1421202112025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2471655880 (or 2471655875 counting only the distinct ones).
The product of its (nonzero) digits is 640, while the sum is 23.
Adding to 1421202112025 its reverse (5202112021241), we get a palindrome (6623314133266).
The spelling of 1421202112025 in words is "one trillion, four hundred twenty-one billion, two hundred two million, one hundred twelve thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •