Base | Representation |
---|---|
bin | 101111100000100101… |
… | …1101100001101000111 |
3 | 100202100022122000022200 |
4 | 1133001023230031013 |
5 | 3132421440041033 |
6 | 114511512325543 |
7 | 10241165604243 |
oct | 1370113541507 |
9 | 322308560280 |
10 | 102025315143 |
11 | 3a2a56a3374 |
12 | 179340a38b3 |
13 | 980c2ab57b |
14 | 4d1c029423 |
15 | 29c1e4d013 |
hex | 17c12ec347 |
102025315143 has 12 divisors (see below), whose sum is σ = 147372684888. Its totient is φ = 68015591280.
The previous prime is 102025315103. The next prime is 102025315163. The reversal of 102025315143 is 341513520201.
102025315143 is a `hidden beast` number, since 1 + 0 + 202 + 5 + 315 + 143 = 666.
It is not a de Polignac number, because 102025315143 - 210 = 102025314119 is a prime.
It is a super-2 number, since 2×1020253151432 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102025315103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 798388 + ... + 917318.
It is an arithmetic number, because the mean of its divisors is an integer number (12281057074).
Almost surely, 2102025315143 is an apocalyptic number.
102025315143 is a deficient number, since it is larger than the sum of its proper divisors (45347369745).
102025315143 is a wasteful number, since it uses less digits than its factorization.
102025315143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 214254 (or 214251 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 102025315143 its reverse (341513520201), we get a palindrome (443538835344).
The spelling of 102025315143 in words is "one hundred two billion, twenty-five million, three hundred fifteen thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •