Base | Representation |
---|---|
bin | 101111101100011010… |
… | …1100000110000000101 |
3 | 100210100222100112020012 |
4 | 1133120311200300011 |
5 | 3134230032413440 |
6 | 115015130120005 |
7 | 10254054642455 |
oct | 1373065406005 |
9 | 323328315205 |
10 | 102422154245 |
11 | 3a4896aa474 |
12 | 17a24b80005 |
13 | 98735841c8 |
14 | 4d58a09d65 |
15 | 29e6bd9e65 |
hex | 17d8d60c05 |
102422154245 has 8 divisors (see below), whose sum is σ = 123127246584. Its totient is φ = 81790615744.
The previous prime is 102422154239. The next prime is 102422154253. The reversal of 102422154245 is 542451224201.
It can be written as a sum of positive squares in 4 ways, for example, as 2425168516 + 99996985729 = 49246^2 + 316223^2 .
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 102422154245 - 26 = 102422154181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 18385394 + ... + 18390963.
It is an arithmetic number, because the mean of its divisors is an integer number (15390905823).
Almost surely, 2102422154245 is an apocalyptic number.
It is an amenable number.
102422154245 is a deficient number, since it is larger than the sum of its proper divisors (20705092339).
102422154245 is an equidigital number, since it uses as much as digits as its factorization.
102422154245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36776919.
The product of its (nonzero) digits is 25600, while the sum is 32.
Adding to 102422154245 its reverse (542451224201), we get a palindrome (644873378446).
The spelling of 102422154245 in words is "one hundred two billion, four hundred twenty-two million, one hundred fifty-four thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •