Base | Representation |
---|---|
bin | 110001011101110000… |
… | …0010111101011100001 |
3 | 101011012000011010220100 |
4 | 1202323200113223201 |
5 | 3220022102240342 |
6 | 120444335133013 |
7 | 10450232641311 |
oct | 1427340275341 |
9 | 334160133810 |
10 | 106225040097 |
11 | 410602a1940 |
12 | 18706674169 |
13 | a02b3bc017 |
14 | 51d9acd441 |
15 | 2b6a9c5e4c |
hex | 18bb817ae1 |
106225040097 has 24 divisors (see below), whose sum is σ = 167433870240. Its totient is φ = 64359982080.
The previous prime is 106225040083. The next prime is 106225040101. The reversal of 106225040097 is 790040522601.
106225040097 is a `hidden beast` number, since 1 + 0 + 62 + 2 + 504 + 0 + 0 + 97 = 666.
It is not a de Polignac number, because 106225040097 - 210 = 106225039073 is a prime.
It is a super-2 number, since 2×1062250400972 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106225040017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 187054 + ... + 497432.
It is an arithmetic number, because the mean of its divisors is an integer number (6976411260).
Almost surely, 2106225040097 is an apocalyptic number.
It is an amenable number.
106225040097 is a deficient number, since it is larger than the sum of its proper divisors (61208830143).
106225040097 is a wasteful number, since it uses less digits than its factorization.
106225040097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 313853 (or 313850 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 36.
Adding to 106225040097 its reverse (790040522601), we get a palindrome (896265562698).
The spelling of 106225040097 in words is "one hundred six billion, two hundred twenty-five million, forty thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •