Base | Representation |
---|---|
bin | 10111011011000001100011… |
… | …010101111010011101000101 |
3 | 111111201212101201010110220201 |
4 | 113123001203111322131011 |
5 | 102000222402023103401 |
6 | 1003031044542530501 |
7 | 30461245261320013 |
oct | 2733014325723505 |
9 | 444655351113821 |
10 | 103012162316101 |
11 | 2a906238118a65 |
12 | b678544896a31 |
13 | 456300b62c39c |
14 | 1b61b5b0d98b3 |
15 | bd98b1b47b01 |
hex | 5db06357a745 |
103012162316101 has 16 divisors (see below), whose sum is σ = 109492953899200. Its totient is φ = 96641603480448.
The previous prime is 103012162316053. The next prime is 103012162316111. The reversal of 103012162316101 is 101613261210301.
It is a cyclic number.
It is not a de Polignac number, because 103012162316101 - 213 = 103012162307909 is a prime.
It is a super-2 number, since 2×1030121623161012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103012162316101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103012162316111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 59181696 + ... + 60897433.
It is an arithmetic number, because the mean of its divisors is an integer number (6843309618700).
Almost surely, 2103012162316101 is an apocalyptic number.
It is an amenable number.
103012162316101 is a deficient number, since it is larger than the sum of its proper divisors (6480791583099).
103012162316101 is a wasteful number, since it uses less digits than its factorization.
103012162316101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120079588.
The product of its (nonzero) digits is 1296, while the sum is 28.
The spelling of 103012162316101 in words is "one hundred three trillion, twelve billion, one hundred sixty-two million, three hundred sixteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •