Base | Representation |
---|---|
bin | 101111101001001100… |
… | …1010111110101111111 |
3 | 100210002110001112110121 |
4 | 1133102121113311333 |
5 | 3134014403130211 |
6 | 115000310315411 |
7 | 10251303423544 |
oct | 1372231276577 |
9 | 323073045417 |
10 | 102314114431 |
11 | 3a433717571 |
12 | 179b4958b67 |
13 | 9857087119 |
14 | 4d48524bcb |
15 | 29dc498271 |
hex | 17d2657d7f |
102314114431 has 8 divisors (see below), whose sum is σ = 102993508800. Its totient is φ = 101636814720.
The previous prime is 102314114407. The next prime is 102314114449. The reversal of 102314114431 is 134411413201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102314114431 is a prime.
It is a super-2 number, since 2×1023141144312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102314114396 and 102314114405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102314112431) 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, 425590 + ... + 621091.
It is an arithmetic number, because the mean of its divisors is an integer number (12874188600).
Almost surely, 2102314114431 is an apocalyptic number.
102314114431 is a deficient number, since it is larger than the sum of its proper divisors (679394369).
102314114431 is a wasteful number, since it uses less digits than its factorization.
102314114431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047329.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 102314114431 its reverse (134411413201), we get a palindrome (236725527632).
The spelling of 102314114431 in words is "one hundred two billion, three hundred fourteen million, one hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •