Base | Representation |
---|---|
bin | 101111101000110100… |
… | …0100010000000011001 |
3 | 100210001112222001110111 |
4 | 1133101220202000121 |
5 | 3134003113423001 |
6 | 114555132044321 |
7 | 10251056540011 |
oct | 1372150420031 |
9 | 323045861414 |
10 | 102301311001 |
11 | 3a42747211a |
12 | 179b06036a1 |
13 | 9854523526 |
14 | 4d46950c41 |
15 | 29db2b9851 |
hex | 17d1a22019 |
102301311001 has 8 divisors (see below), whose sum is σ = 106757472384. Its totient is φ = 97845839520.
The previous prime is 102301310983. The next prime is 102301311011. The reversal of 102301311001 is 100113103201.
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 102301311001 - 219 = 102300786713 is a prime.
It is a super-3 number, since 3×1023013110013 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102301311011) 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, 142836 + ... + 474346.
It is an arithmetic number, because the mean of its divisors is an integer number (13344684048).
Almost surely, 2102301311001 is an apocalyptic number.
It is an amenable number.
102301311001 is a deficient number, since it is larger than the sum of its proper divisors (4456161383).
102301311001 is a wasteful number, since it uses less digits than its factorization.
102301311001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 344951.
The product of its (nonzero) digits is 18, while the sum is 13.
Adding to 102301311001 its reverse (100113103201), we get a palindrome (202414414202).
It can be divided in two parts, 10230 and 1311001, that added together give a palindrome (1321231).
The spelling of 102301311001 in words is "one hundred two billion, three hundred one million, three hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •