Base | Representation |
---|---|
bin | 11101011111000011000… |
… | …10000111111011101111 |
3 | 10120211222202111222002121 |
4 | 32233201202013323233 |
5 | 113044312342233201 |
6 | 2053225013133411 |
7 | 133123406356453 |
oct | 16574142077357 |
9 | 3524882458077 |
10 | 1013101133551 |
11 | 3607211a64a1 |
12 | 14441962a267 |
13 | 746c55b9c80 |
14 | 3706a3ba663 |
15 | 1b5469e39a1 |
hex | ebe1887eef |
1013101133551 has 32 divisors (see below), whose sum is σ = 1118823632640. Its totient is φ = 911735571456.
The previous prime is 1013101133521. The next prime is 1013101133581. The reversal of 1013101133551 is 1553311013101.
It is an interprime number because it is at equal distance from previous prime (1013101133521) and next prime (1013101133581).
It is a cyclic number.
It is not a de Polignac number, because 1013101133551 - 211 = 1013101131503 is a prime.
It is a super-2 number, since 2×10131011335512 (a number of 25 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 (1013101133521) 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, 24130960 + ... + 24172906.
It is an arithmetic number, because the mean of its divisors is an integer number (34963238520).
Almost surely, 21013101133551 is an apocalyptic number.
1013101133551 is a deficient number, since it is larger than the sum of its proper divisors (105722499089).
1013101133551 is a wasteful number, since it uses less digits than its factorization.
1013101133551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42343.
The product of its (nonzero) digits is 675, while the sum is 25.
Adding to 1013101133551 its reverse (1553311013101), we get a palindrome (2566412146652).
The spelling of 1013101133551 in words is "one trillion, thirteen billion, one hundred one million, one hundred thirty-three thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •