Base | Representation |
---|---|
bin | 10100011001110100010… |
… | …010110011010101011101 |
3 | 11222001002111010110112000 |
4 | 110121310102303111131 |
5 | 140433010232040123 |
6 | 2552042020232513 |
7 | 203204413651626 |
oct | 24316422632535 |
9 | 4861074113460 |
10 | 1402110424413 |
11 | 4a06a48663a6 |
12 | 1a78a3b3b739 |
13 | a22abc0480a |
14 | 4bc10a0aa4d |
15 | 26713585b43 |
hex | 146744b355d |
1402110424413 has 16 divisors (see below), whose sum is σ = 2199388901760. Its totient is φ = 879755560128.
The previous prime is 1402110424409. The next prime is 1402110424433. The reversal of 1402110424413 is 3144240112041.
1402110424413 is a `hidden beast` number, since 1 + 4 + 0 + 211 + 0 + 4 + 2 + 441 + 3 = 666.
It is not a de Polignac number, because 1402110424413 - 22 = 1402110424409 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1402110424433) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1527352945 + ... + 1527353862.
It is an arithmetic number, because the mean of its divisors is an integer number (137461806360).
Almost surely, 21402110424413 is an apocalyptic number.
It is an amenable number.
1402110424413 is a deficient number, since it is larger than the sum of its proper divisors (797278477347).
1402110424413 is a wasteful number, since it uses less digits than its factorization.
1402110424413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3054706833 (or 3054706827 counting only the distinct ones).
The product of its (nonzero) digits is 3072, while the sum is 27.
Adding to 1402110424413 its reverse (3144240112041), we get a palindrome (4546350536454).
The spelling of 1402110424413 in words is "one trillion, four hundred two billion, one hundred ten million, four hundred twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •