Base | Representation |
---|---|
bin | 10110111111101000110001… |
… | …000011101110110001011101 |
3 | 111021001221112011010220210111 |
4 | 112333220301003232301131 |
5 | 101223403442442410323 |
6 | 555030312005010021 |
7 | 30205260503226610 |
oct | 2677506103566135 |
9 | 437057464126714 |
10 | 101130123013213 |
11 | 2a250053a90908 |
12 | b4138416b3911 |
13 | 44576b6926898 |
14 | 1ad8a1cbc6177 |
15 | ba595ea97c0d |
hex | 5bfa310eec5d |
101130123013213 has 8 divisors (see below), whose sum is σ = 121660298361920. Its totient is φ = 82120701394080.
The previous prime is 101130123013207. The next prime is 101130123013217. The reversal of 101130123013213 is 312310321031101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-101130123013213 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101130123013217) 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, 380188432248 + ... + 380188432513.
It is an arithmetic number, because the mean of its divisors is an integer number (15207537295240).
Almost surely, 2101130123013213 is an apocalyptic number.
It is an amenable number.
101130123013213 is a deficient number, since it is larger than the sum of its proper divisors (20530175348707).
101130123013213 is an equidigital number, since it uses as much as digits as its factorization.
101130123013213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 760376864787.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 101130123013213 its reverse (312310321031101), we get a palindrome (413440444044314).
The spelling of 101130123013213 in words is "one hundred one trillion, one hundred thirty billion, one hundred twenty-three million, thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •