Base | Representation |
---|---|
bin | 11101011011101111111… |
… | …10010010000100110111 |
3 | 10120200102100001200021001 |
4 | 32231313332102010313 |
5 | 113032201003131411 |
6 | 2052333150304131 |
7 | 133031463161461 |
oct | 16556776220467 |
9 | 3520370050231 |
10 | 1011330130231 |
11 | 35a9a2547493 |
12 | 1440044b8047 |
13 | 744a2710305 |
14 | 36d3d0d1131 |
15 | 1b4912b6dc1 |
hex | eb77f92137 |
1011330130231 has 6 divisors (see below), whose sum is σ = 1039402114800. Its totient is φ = 983996882136.
The previous prime is 1011330130207. The next prime is 1011330130277. The reversal of 1011330130231 is 1320310331101.
It is not a de Polignac number, because 1011330130231 - 27 = 1011330130103 is a prime.
It is a super-2 number, since 2×10113301302312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1011330130199 and 1011330130208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1011330134231) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 369366831 + ... + 369369568.
It is an arithmetic number, because the mean of its divisors is an integer number (173233685800).
Almost surely, 21011330130231 is an apocalyptic number.
1011330130231 is a deficient number, since it is larger than the sum of its proper divisors (28071984569).
1011330130231 is an frugal number, since it uses more digits than its factorization.
1011330130231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 738736473 (or 738736436 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 1011330130231 its reverse (1320310331101), we get a palindrome (2331640461332).
The spelling of 1011330130231 in words is "one trillion, eleven billion, three hundred thirty million, one hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •