Base | Representation |
---|---|
bin | 10100011101110111000… |
… | …000110010101011110111 |
3 | 11222110021222200122201200 |
4 | 110131313000302223313 |
5 | 141020402424031403 |
6 | 2554040434023543 |
7 | 203420111160240 |
oct | 24356700625367 |
9 | 4873258618650 |
10 | 1406451002103 |
11 | 4a2521a19694 |
12 | 1a86b5717bb3 |
13 | a2821260794 |
14 | 4c103297cc7 |
15 | 268b9682ca3 |
hex | 14777032af7 |
1406451002103 has 24 divisors (see below), whose sum is σ = 2330391492000. Its totient is φ = 800698595904.
The previous prime is 1406451002101. The next prime is 1406451002137. The reversal of 1406451002103 is 3012001546041.
It is a happy number.
1406451002103 is a `hidden beast` number, since 1 + 4 + 0 + 645 + 1 + 0 + 0 + 2 + 10 + 3 = 666.
It is not a de Polignac number, because 1406451002103 - 21 = 1406451002101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1406451002101) 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 23 ways as a sum of consecutive naturals, for example, 41478628 + ... + 41512521.
It is an arithmetic number, because the mean of its divisors is an integer number (97099645500).
Almost surely, 21406451002103 is an apocalyptic number.
1406451002103 is a deficient number, since it is larger than the sum of its proper divisors (923940489897).
1406451002103 is a wasteful number, since it uses less digits than its factorization.
1406451002103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82991431 (or 82991428 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 1406451002103 its reverse (3012001546041), we get a palindrome (4418452548144).
The spelling of 1406451002103 in words is "one trillion, four hundred six billion, four hundred fifty-one million, two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •