Base | Representation |
---|---|
bin | 101111001011000100… |
… | …1001010001101010001 |
3 | 100200110222220100112010 |
4 | 1132112021022031101 |
5 | 3124432111400223 |
6 | 114312115453133 |
7 | 10214250154464 |
oct | 1362611121521 |
9 | 320428810463 |
10 | 101303231313 |
11 | 39a65040079 |
12 | 177722b71a9 |
13 | 972580942b |
14 | 4c901832db |
15 | 297d867393 |
hex | 179624a351 |
101303231313 has 8 divisors (see below), whose sum is σ = 135079792288. Its totient is φ = 67531078944.
The previous prime is 101303231299. The next prime is 101303231357. The reversal of 101303231313 is 313132303101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101303231313 - 218 = 101302969169 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101303231313.
It is not an unprimeable number, because it can be changed into a prime (101303231413) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1048156 + ... + 1140717.
It is an arithmetic number, because the mean of its divisors is an integer number (16884974036).
Almost surely, 2101303231313 is an apocalyptic number.
It is an amenable number.
101303231313 is a deficient number, since it is larger than the sum of its proper divisors (33776560975).
101303231313 is a wasteful number, since it uses less digits than its factorization.
101303231313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2204303.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 101303231313 its reverse (313132303101), we get a palindrome (414435534414).
The spelling of 101303231313 in words is "one hundred one billion, three hundred three million, two hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •