Base | Representation |
---|---|
bin | 1011111101100011011110… |
… | …0110110000100100001111 |
3 | 1201120022221001022210220102 |
4 | 2333120313212300210033 |
5 | 3210441021412031011 |
6 | 43550000215241315 |
7 | 2525131601653511 |
oct | 277306746604417 |
9 | 51508831283812 |
10 | 13152122767631 |
11 | 4210869477661 |
12 | 1584b7737923b |
13 | 745316c677a3 |
14 | 3367cd6abbb1 |
15 | 17c1b47c973b |
hex | bf6379b090f |
13152122767631 has 4 divisors (see below), whose sum is σ = 13152133030200. Its totient is φ = 13152112505064.
The previous prime is 13152122767627. The next prime is 13152122767643. The reversal of 13152122767631 is 13676722125131.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 13152122767631 - 22 = 13152122767627 is a prime.
It is a super-2 number, since 2×131521227676312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13152122707631) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2879576 + ... + 5881853.
It is an arithmetic number, because the mean of its divisors is an integer number (3288033257550).
Almost surely, 213152122767631 is an apocalyptic number.
13152122767631 is a deficient number, since it is larger than the sum of its proper divisors (10262569).
13152122767631 is an equidigital number, since it uses as much as digits as its factorization.
13152122767631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10262568.
The product of its digits is 635040, while the sum is 47.
The spelling of 13152122767631 in words is "thirteen trillion, one hundred fifty-two billion, one hundred twenty-two million, seven hundred sixty-seven thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •