Base | Representation |
---|---|
bin | 110001011000000010… |
… | …0011000011001101001 |
3 | 101010200122002022011120 |
4 | 1202300010120121221 |
5 | 3214123441404031 |
6 | 120413322245453 |
7 | 10442412635502 |
oct | 1426004303151 |
9 | 333618068146 |
10 | 106033153641 |
11 | 40a71a50798 |
12 | 18672356889 |
13 | 9cca715a3c |
14 | 51bc41dba9 |
15 | 2b58c20a96 |
hex | 18b0118669 |
106033153641 has 8 divisors (see below), whose sum is σ = 145938104064. Its totient is φ = 68408486160.
The previous prime is 106033153631. The next prime is 106033153657. The reversal of 106033153641 is 146351330601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106033153641 - 29 = 106033153129 is a prime.
It is a super-2 number, since 2×1060331536412 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106033153601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 570070626 + ... + 570070811.
It is an arithmetic number, because the mean of its divisors is an integer number (18242263008).
Almost surely, 2106033153641 is an apocalyptic number.
It is an amenable number.
106033153641 is a deficient number, since it is larger than the sum of its proper divisors (39904950423).
106033153641 is a wasteful number, since it uses less digits than its factorization.
106033153641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1140141471.
The product of its (nonzero) digits is 19440, while the sum is 33.
The spelling of 106033153641 in words is "one hundred six billion, thirty-three million, one hundred fifty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •