Base | Representation |
---|---|
bin | 110001011000110101… |
… | …1111111100110010111 |
3 | 101010202112012020120222 |
4 | 1202301223333212113 |
5 | 3214202420040111 |
6 | 120420132344555 |
7 | 10443162542306 |
oct | 1426153774627 |
9 | 333675166528 |
10 | 106060315031 |
11 | 40a86312520 |
12 | 1867b47515b |
13 | a003235978 |
14 | 51c1c9043d |
15 | 2b5b2d87db |
hex | 18b1aff997 |
106060315031 has 16 divisors (see below), whose sum is σ = 115885261440. Its totient is φ = 96266026080.
The previous prime is 106060315027. The next prime is 106060315061. The reversal of 106060315031 is 130513060601.
It is a cyclic number.
It is not a de Polignac number, because 106060315031 - 22 = 106060315027 is a prime.
It is a super-2 number, since 2×1060603150312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106060315001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 31686500 + ... + 31689846.
It is an arithmetic number, because the mean of its divisors is an integer number (7242828840).
Almost surely, 2106060315031 is an apocalyptic number.
106060315031 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
106060315031 is a deficient number, since it is larger than the sum of its proper divisors (9824946409).
106060315031 is a wasteful number, since it uses less digits than its factorization.
106060315031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7054.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 106060315031 its reverse (130513060601), we get a palindrome (236573375632).
The spelling of 106060315031 in words is "one hundred six billion, sixty million, three hundred fifteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •