Base | Representation |
---|---|
bin | 10110111111010111111001… |
… | …100111101000011001100101 |
3 | 111021000012210001000111120000 |
4 | 112333113321213220121211 |
5 | 101223104400313443023 |
6 | 555014114553131513 |
7 | 30204046641015645 |
oct | 2677277147503145 |
9 | 437005701014500 |
10 | 101112013031013 |
11 | 2a24340040a176 |
12 | b4102286b9b99 |
13 | 4455a8b99909a |
14 | 1ad7bc192a525 |
15 | ba524ec17243 |
hex | 5bf5f99e8665 |
101112013031013 has 40 divisors (see below), whose sum is σ = 155086867748736. Its totient is φ = 65611325505600.
The previous prime is 101112013031009. The next prime is 101112013031077. The reversal of 101112013031013 is 310130310211101.
101112013031013 is a `hidden beast` number, since 1 + 0 + 111 + 201 + 30 + 310 + 13 = 666.
It is not a de Polignac number, because 101112013031013 - 22 = 101112013031009 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101112013038013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 33889131 + ... + 36751832.
Almost surely, 2101112013031013 is an apocalyptic number.
It is an amenable number.
101112013031013 is a deficient number, since it is larger than the sum of its proper divisors (53974854717723).
101112013031013 is an equidigital number, since it uses as much as digits as its factorization.
101112013031013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70641447 (or 70641438 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 101112013031013 its reverse (310130310211101), we get a palindrome (411242323242114).
The spelling of 101112013031013 in words is "one hundred one trillion, one hundred twelve billion, thirteen million, thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •