Base | Representation |
---|---|
bin | 10110111101110001101000… |
… | …010000111011011100101001 |
3 | 111020121201022222210202010201 |
4 | 112331301220100323130221 |
5 | 101214310001222413001 |
6 | 554451434211112201 |
7 | 30163111451245411 |
oct | 2675615020733451 |
9 | 436551288722121 |
10 | 101002200201001 |
11 | 2a200879989700 |
12 | b3b2aa05a2661 |
13 | 444860b1b3768 |
14 | 1ad2765549641 |
15 | ba2474292501 |
hex | 5bdc6843b729 |
101002200201001 has 12 divisors (see below), whose sum is σ = 111024667526836. Its totient is φ = 91815451009920.
The previous prime is 101002200200987. The next prime is 101002200201037. The reversal of 101002200201001 is 100102002200101.
It can be written as a sum of positive squares in 2 ways, for example, as 1878272991001 + 99123927210000 = 1370501^2 + 9956100^2 .
It is not a de Polignac number, because 101002200201001 - 25 = 101002200200969 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101002200201061) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 19145340 + ... + 23844253.
Almost surely, 2101002200201001 is an apocalyptic number.
101002200201001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101002200201001 is a deficient number, since it is larger than the sum of its proper divisors (10022467325835).
101002200201001 is a wasteful number, since it uses less digits than its factorization.
101002200201001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43009032 (or 43009021 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 101002200201001 its reverse (100102002200101), we get a palindrome (201104202401102).
The spelling of 101002200201001 in words is "one hundred one trillion, two billion, two hundred million, two hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •