Base | Representation |
---|---|
bin | 1011110110011010010011… |
… | …0100000000000000000001 |
3 | 1201010121011100111012000001 |
4 | 2331212210310000000001 |
5 | 3201433203112404211 |
6 | 43413342452000001 |
7 | 2513225462223631 |
oct | 275464464000001 |
9 | 51117140435001 |
10 | 13029400903681 |
11 | 41738131528a8 |
12 | 1565228000001 |
13 | 736889bb0046 |
14 | 3308aaa806c1 |
15 | 178dd08c0ac1 |
hex | bd9a4d00001 |
13029400903681 has 32 divisors (see below), whose sum is σ = 14127039774720. Its totient is φ = 11977584696000.
The previous prime is 13029400903669. The next prime is 13029400903693. The reversal of 13029400903681 is 18630900492031.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (13029400903669) and next prime (13029400903693).
It is a cyclic number.
It is not a de Polignac number, because 13029400903681 - 225 = 13029367349249 is a prime.
It is a super-2 number, since 2×130294009036812 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13029400903081) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 166788531 + ... + 166866631.
It is an arithmetic number, because the mean of its divisors is an integer number (441469992960).
Almost surely, 213029400903681 is an apocalyptic number.
It is an amenable number.
13029400903681 is a deficient number, since it is larger than the sum of its proper divisors (1097638871039).
13029400903681 is a wasteful number, since it uses less digits than its factorization.
13029400903681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79765.
The product of its (nonzero) digits is 279936, while the sum is 46.
The spelling of 13029400903681 in words is "thirteen trillion, twenty-nine billion, four hundred million, nine hundred three thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •