Base | Representation |
---|---|
bin | 10100011101100011010… |
… | …111110110010110010101 |
3 | 11222102110000200022200220 |
4 | 110131203113312112111 |
5 | 141014214101031401 |
6 | 2553544023424553 |
7 | 203406000363651 |
oct | 24354327662625 |
9 | 4872400608626 |
10 | 1406121502101 |
11 | 4a2372a26438 |
12 | 1a86232b5159 |
13 | a279ac04474 |
14 | 4c0b1605a61 |
15 | 2689a798336 |
hex | 147635f6595 |
1406121502101 has 8 divisors (see below), whose sum is σ = 1879775448480. Its totient is φ = 934940945232.
The previous prime is 1406121502069. The next prime is 1406121502127. The reversal of 1406121502101 is 1012051216041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1406121502101 - 25 = 1406121502069 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1406121500101) 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 7 ways as a sum of consecutive naturals, for example, 618346050 + ... + 618348323.
It is an arithmetic number, because the mean of its divisors is an integer number (234971931060).
Almost surely, 21406121502101 is an apocalyptic number.
It is an amenable number.
1406121502101 is a deficient number, since it is larger than the sum of its proper divisors (473653946379).
1406121502101 is a wasteful number, since it uses less digits than its factorization.
1406121502101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1236694755.
The product of its (nonzero) digits is 480, while the sum is 24.
Adding to 1406121502101 its reverse (1012051216041), we get a palindrome (2418172718142).
The spelling of 1406121502101 in words is "one trillion, four hundred six billion, one hundred twenty-one million, five hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •