Base | Representation |
---|---|
bin | 11101011110110111000… |
… | …00010111100100010001 |
3 | 10120211201201020100122221 |
4 | 32233123200113210101 |
5 | 113044111000310001 |
6 | 2053211001501041 |
7 | 133121041004560 |
oct | 16573340274421 |
9 | 3524651210587 |
10 | 1013000010001 |
11 | 36067a107911 |
12 | 1443ab7a1781 |
13 | 746aa671c55 |
14 | 3705abb5bd7 |
15 | 1b53cbbb1a1 |
hex | ebdb817911 |
1013000010001 has 8 divisors (see below), whose sum is σ = 1176693220544. Its totient is φ = 854051530320.
The previous prime is 1013000009971. The next prime is 1013000010017. The reversal of 1013000010001 is 1000100003101.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1013000010001 - 217 = 1012999878929 is a prime.
It is a super-2 number, since 2×10130000100012 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1013000010101) 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, 1186182255 + ... + 1186183108.
It is an arithmetic number, because the mean of its divisors is an integer number (147086652568).
Almost surely, 21013000010001 is an apocalyptic number.
It is an amenable number.
1013000010001 is a deficient number, since it is larger than the sum of its proper divisors (163693210543).
1013000010001 is an equidigital number, since it uses as much as digits as its factorization.
1013000010001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2372365431.
The product of its (nonzero) digits is 3, while the sum is 7.
Adding to 1013000010001 its reverse (1000100003101), we get a palindrome (2013100013102).
The spelling of 1013000010001 in words is "one trillion, thirteen billion, ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •