Base | Representation |
---|---|
bin | 10110111111001101101001… |
… | …010011111000101001110100 |
3 | 111020222011100122211020000001 |
4 | 112333031221103320221310 |
5 | 101222414323003013022 |
6 | 555005054212401044 |
7 | 30203210035553446 |
oct | 2677155123705164 |
9 | 436864318736001 |
10 | 101101002001012 |
11 | 2a23976aa28382 |
12 | b40a075016184 |
13 | 4454a256ac110 |
14 | 1ad74593c8496 |
15 | ba4d081e9b27 |
hex | 5bf3694f8a74 |
101101002001012 has 96 divisors (see below), whose sum is σ = 192870110684160. Its totient is φ = 46092759436800.
The previous prime is 101101002000923. The next prime is 101101002001081. The reversal of 101101002001012 is 210100200101101.
It is a super-3 number, since 3×1011010020010123 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 101101002001012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 5019153013 + ... + 5019173155.
It is an arithmetic number, because the mean of its divisors is an integer number (2009063652960).
Almost surely, 2101101002001012 is an apocalyptic number.
It is an amenable number.
101101002001012 is a deficient number, since it is larger than the sum of its proper divisors (91769108683148).
101101002001012 is a wasteful number, since it uses less digits than its factorization.
101101002001012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22433 (or 22431 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101101002001012 its reverse (210100200101101), we get a palindrome (311201202102113).
The spelling of 101101002001012 in words is "one hundred one trillion, one hundred one billion, two million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •