Base | Representation |
---|---|
bin | 11000001101100011111000… |
… | …110110000111111010111111 |
3 | 111222000212102000201012001111 |
4 | 120031203320312013322333 |
5 | 102424122242024441343 |
6 | 1014250311403422451 |
7 | 31300200445626232 |
oct | 3015437066077277 |
9 | 458025360635044 |
10 | 106485004140223 |
11 | 30a25044862685 |
12 | bb39610524a27 |
13 | 47556538c70a7 |
14 | 1c41c8a39b419 |
15 | c49dbcae2c9d |
hex | 60d8f8d87ebf |
106485004140223 has 4 divisors (see below), whose sum is σ = 112089478042360. Its totient is φ = 100880530238088.
The previous prime is 106485004140211. The next prime is 106485004140247. The reversal of 106485004140223 is 322041400584601.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 106485004140223 - 217 = 106485004009151 is a prime.
It is a super-2 number, since 2×1064850041402232 (a number of 29 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 (106485004140283) 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, 2802236951040 + ... + 2802236951077.
It is an arithmetic number, because the mean of its divisors is an integer number (28022369510590).
Almost surely, 2106485004140223 is an apocalyptic number.
106485004140223 is a deficient number, since it is larger than the sum of its proper divisors (5604473902137).
106485004140223 is an equidigital number, since it uses as much as digits as its factorization.
106485004140223 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5604473902136.
The product of its (nonzero) digits is 184320, while the sum is 40.
The spelling of 106485004140223 in words is "one hundred six trillion, four hundred eighty-five billion, four million, one hundred forty thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •