Base | Representation |
---|---|
bin | 11101100110110110011010… |
… | …110101110100010100011111 |
3 | 122002001020211022100200112220 |
4 | 131212312122311310110133 |
5 | 114031402433023441111 |
6 | 1140535025423200423 |
7 | 36266405351030502 |
oct | 3546663265642437 |
9 | 562036738320486 |
10 | 130213121312031 |
11 | 3854309037135a |
12 | 12730212a46113 |
13 | 578707713c204 |
14 | 24224c4b87139 |
15 | 100c21e933e06 |
hex | 766d9ad7451f |
130213121312031 has 8 divisors (see below), whose sum is σ = 173617551686784. Its totient is φ = 86808719239320.
The previous prime is 130213121312011. The next prime is 130213121312063.
130213121312031 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 130213121312031 - 227 = 130212987094303 is a prime.
It is a super-2 number, since 2×1302131213120312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130213121311992 and 130213121312010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130213121312011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8657380 + ... + 18313286.
It is an arithmetic number, because the mean of its divisors is an integer number (21702193960848).
Almost surely, 2130213121312031 is an apocalyptic number.
130213121312031 is a deficient number, since it is larger than the sum of its proper divisors (43404430374753).
130213121312031 is an equidigital number, since it uses as much as digits as its factorization.
130213121312031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14151021.
The product of its (nonzero) digits is 648, while the sum is 24.
The spelling of 130213121312031 in words is "one hundred thirty trillion, two hundred thirteen billion, one hundred twenty-one million, three hundred twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •