Base | Representation |
---|---|
bin | 10110111101110001101111… |
… | …011110001010001111111110 |
3 | 111020121201122102022120010022 |
4 | 112331301233132022033332 |
5 | 101214310223201010024 |
6 | 554451454210412142 |
7 | 30163114450044002 |
oct | 2675615736121776 |
9 | 436551572276108 |
10 | 101002321110014 |
11 | 2a200931161405 |
12 | b3b2b14b91052 |
13 | 444862a26835c |
14 | 1ad2777620702 |
15 | ba247ebc735e |
hex | 5bdc6f78a3fe |
101002321110014 has 16 divisors (see below), whose sum is σ = 156728995441920. Its totient is φ = 48759350535840.
The previous prime is 101002321109981. The next prime is 101002321110023. The reversal of 101002321110014 is 410011123200101.
It is a super-3 number, since 3×1010023211100143 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 101002321109974 and 101002321110001.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 390947 + ... + 14218209.
It is an arithmetic number, because the mean of its divisors is an integer number (9795562215120).
Almost surely, 2101002321110014 is an apocalyptic number.
101002321110014 is a deficient number, since it is larger than the sum of its proper divisors (55726674331906).
101002321110014 is a wasteful number, since it uses less digits than its factorization.
101002321110014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13953235.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 101002321110014 its reverse (410011123200101), we get a palindrome (511013444310115).
The spelling of 101002321110014 in words is "one hundred one trillion, two billion, three hundred twenty-one million, one hundred ten thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •