Base | Representation |
---|---|
bin | 101101110000100110000101… |
… | …0111011001011101001100101 |
3 | 1221210010220201011001222211120 |
4 | 1123201030022323023221211 |
5 | 410224102213104243023 |
6 | 3544015202342324153 |
7 | 150531612432020550 |
oct | 13341141273135145 |
9 | 1853126634058746 |
10 | 402503043431013 |
11 | 107282644869718 |
12 | 39187952a29659 |
13 | 14378b4960c835 |
14 | 71573735cb697 |
15 | 31800640118e3 |
hex | 16e130aecba65 |
402503043431013 has 48 divisors (see below), whose sum is σ = 651697478959104. Its totient is φ = 216419554794240.
The previous prime is 402503043430991. The next prime is 402503043431051. The reversal of 402503043431013 is 310134340305204.
It is not a de Polignac number, because 402503043431013 - 225 = 402503009876581 is a prime.
It is a super-3 number, since 3×4025030434310133 (a number of 45 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (402503043431053) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 16883356 + ... + 33015962.
It is an arithmetic number, because the mean of its divisors is an integer number (13577030811648).
Almost surely, 2402503043431013 is an apocalyptic number.
It is an amenable number.
402503043431013 is a deficient number, since it is larger than the sum of its proper divisors (249194435528091).
402503043431013 is a wasteful number, since it uses less digits than its factorization.
402503043431013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16136762 (or 16136745 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 33.
Adding to 402503043431013 its reverse (310134340305204), we get a palindrome (712637383736217).
The spelling of 402503043431013 in words is "four hundred two trillion, five hundred three billion, forty-three million, four hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •