Base | Representation |
---|---|
bin | 10011010110011001100000… |
… | …011100101000001001011110 |
3 | 102011022200101200100122112221 |
4 | 103112121200130220021132 |
5 | 42123303100112321113 |
6 | 500555210505015554 |
7 | 23632265242435342 |
oct | 2326314034501136 |
9 | 364280350318487 |
10 | 85102100120158 |
11 | 25130663a020a0 |
12 | 96654351845ba |
13 | 386412a866664 |
14 | 1702d6c279622 |
15 | 9c8a7a93298d |
hex | 4d666072825e |
85102100120158 has 8 divisors (see below), whose sum is σ = 139257982014840. Its totient is φ = 38682772781880.
The previous prime is 85102100120137. The next prime is 85102100120161.
It is a happy number.
85102100120158 is nontrivially palindromic in base 10.
85102100120158 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×851021001201582 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1934138639073 + ... + 1934138639116.
It is an arithmetic number, because the mean of its divisors is an integer number (17407247751855).
Almost surely, 285102100120158 is an apocalyptic number.
85102100120158 is a deficient number, since it is larger than the sum of its proper divisors (54155881894682).
85102100120158 is a wasteful number, since it uses less digits than its factorization.
85102100120158 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3868277278202.
The product of its (nonzero) digits is 6400, while the sum is 34.
It can be divided in two parts, 85102100 and 120158, that added together give a palindrome (85222258).
The spelling of 85102100120158 in words is "eighty-five trillion, one hundred two billion, one hundred million, one hundred twenty thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •