Base | Representation |
---|---|
bin | 11000001100111010010111… |
… | …011011001111011001010001 |
3 | 111221212121022212211201120010 |
4 | 120030322113123033121101 |
5 | 102422404440011430113 |
6 | 1014214015351305133 |
7 | 31264031556142545 |
oct | 3014722733173121 |
9 | 457777285751503 |
10 | 106440420030033 |
11 | 30a08146235821 |
12 | bb30a4937b1a9 |
13 | 4751399bcbbbb |
14 | 1c3da5b06ba25 |
15 | c48b5d9561c3 |
hex | 60ce976cf651 |
106440420030033 has 8 divisors (see below), whose sum is σ = 141921855504000. Its totient is φ = 70959632288048.
The previous prime is 106440420029989. The next prime is 106440420030047. The reversal of 106440420030033 is 330030024044601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106440420030033 - 28 = 106440420029777 is a prime.
It is a super-2 number, since 2×1064404200300332 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106440420030053) 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, 161549433 + ... + 162206966.
It is an arithmetic number, because the mean of its divisors is an integer number (17740231938000).
Almost surely, 2106440420030033 is an apocalyptic number.
It is an amenable number.
106440420030033 is a deficient number, since it is larger than the sum of its proper divisors (35481435473967).
106440420030033 is a wasteful number, since it uses less digits than its factorization.
106440420030033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 323865991.
The product of its (nonzero) digits is 20736, while the sum is 30.
Adding to 106440420030033 its reverse (330030024044601), we get a palindrome (436470444074634).
The spelling of 106440420030033 in words is "one hundred six trillion, four hundred forty billion, four hundred twenty million, thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •