Base | Representation |
---|---|
bin | 10111000000101010110001… |
… | …101101110111111001001001 |
3 | 111021022201110202121202221001 |
4 | 113000222301231313321021 |
5 | 101231034122230133001 |
6 | 555123033102415001 |
7 | 30213350101321000 |
oct | 2700526155677111 |
9 | 437281422552831 |
10 | 101201001021001 |
11 | 2a278115854152 |
12 | b425522591461 |
13 | 44612a0c3776b |
14 | 1adc224271c37 |
15 | ba770c2de001 |
hex | 5c0ab1b77e49 |
101201001021001 has 8 divisors (see below), whose sum is σ = 118018660083200. Its totient is φ = 86743715160564.
The previous prime is 101201001020923. The next prime is 101201001021011. The reversal of 101201001021001 is 100120100102101.
It is not a de Polignac number, because 101201001021001 - 215 = 101201000988233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101201001021011) 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, 147523324761 + ... + 147523325446.
It is an arithmetic number, because the mean of its divisors is an integer number (14752332510400).
Almost surely, 2101201001021001 is an apocalyptic number.
It is an amenable number.
101201001021001 is a deficient number, since it is larger than the sum of its proper divisors (16817659062199).
101201001021001 is an frugal number, since it uses more digits than its factorization.
101201001021001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295046650228 (or 295046650214 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101201001021001 its reverse (100120100102101), we get a palindrome (201321101123102).
It can be divided in two parts, 10120100102100 and 1, that added together give a palindrome (10120100102101).
The spelling of 101201001021001 in words is "one hundred one trillion, two hundred one billion, one million, twenty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •