Base | Representation |
---|---|
bin | 10111010010101100100101… |
… | …101001000000101001110001 |
3 | 111102201011021112000011010101 |
4 | 113102230211221000221301 |
5 | 101411333402000000330 |
6 | 1001512123324032401 |
7 | 30402016063105501 |
oct | 2722544551005161 |
9 | 442634245004111 |
10 | 102439896484465 |
11 | 2a705574a65671 |
12 | b5a5656092701 |
13 | 452106b7c61b7 |
14 | 1b421903a7a01 |
15 | bc9a6ba314ca |
hex | 5d2b25a40a71 |
102439896484465 has 8 divisors (see below), whose sum is σ = 122927957403048. Its totient is φ = 81951862773120.
The previous prime is 102439896484463. The next prime is 102439896484483. The reversal of 102439896484465 is 564484698934201.
It can be written as a sum of positive squares in 4 ways, for example, as 20680993188496 + 81758903295969 = 4547636^2 + 9042063^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102439896484465 - 21 = 102439896484463 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102439896484463) 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, 2684269 + ... + 14563141.
It is an arithmetic number, because the mean of its divisors is an integer number (15365994675381).
Almost surely, 2102439896484465 is an apocalyptic number.
It is an amenable number.
102439896484465 is a deficient number, since it is larger than the sum of its proper divisors (20488060918583).
102439896484465 is a wasteful number, since it uses less digits than its factorization.
102439896484465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13603619.
The product of its (nonzero) digits is 1433272320, while the sum is 73.
The spelling of 102439896484465 in words is "one hundred two trillion, four hundred thirty-nine billion, eight hundred ninety-six million, four hundred eighty-four thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •