Base | Representation |
---|---|
bin | 110001100000001010… |
… | …1110010100001001001 |
3 | 101011101122210002020012 |
4 | 1203000111302201021 |
5 | 3220203333340041 |
6 | 120500353441305 |
7 | 10452236246552 |
oct | 1430025624111 |
9 | 334348702205 |
10 | 106306152521 |
11 | 410a20628a8 |
12 | 18729870235 |
13 | a04214b83a |
14 | 52067a5329 |
15 | 2b72b993eb |
hex | 18c0572849 |
106306152521 has 4 divisors (see below), whose sum is σ = 111901213200. Its totient is φ = 100711091844.
The previous prime is 106306152499. The next prime is 106306152523. The reversal of 106306152521 is 125251603601.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 125251603601 = 41 ⋅3054917161.
It is a cyclic number.
It is not a de Polignac number, because 106306152521 - 230 = 105232410697 is a prime.
It is a super-2 number, since 2×1063061525212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (106306152523) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2797530311 + ... + 2797530348.
It is an arithmetic number, because the mean of its divisors is an integer number (27975303300).
Almost surely, 2106306152521 is an apocalyptic number.
It is an amenable number.
106306152521 is a deficient number, since it is larger than the sum of its proper divisors (5595060679).
106306152521 is an equidigital number, since it uses as much as digits as its factorization.
106306152521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5595060678.
The product of its (nonzero) digits is 10800, while the sum is 32.
The spelling of 106306152521 in words is "one hundred six billion, three hundred six million, one hundred fifty-two thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •