Base | Representation |
---|---|
bin | 101111101110001011… |
… | …1000111101100000010 |
3 | 100210112002122020122101 |
4 | 1133130113013230002 |
5 | 3134340202434010 |
6 | 115025041501014 |
7 | 10255403434003 |
oct | 1373427075402 |
9 | 323462566571 |
10 | 102481296130 |
11 | 3a50a024664 |
12 | 17a4094176a |
13 | 98828c06c5 |
14 | 4d628031aa |
15 | 29ebebd73a |
hex | 17dc5c7b02 |
102481296130 has 8 divisors (see below), whose sum is σ = 184466333052. Its totient is φ = 40992518448.
The previous prime is 102481296103. The next prime is 102481296131. The reversal of 102481296130 is 31692184201.
102481296130 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Cunningham number, because it is equal to 3201272+1.
It can be written as a sum of positive squares in 2 ways, for example, as 102481296129 + 1 = 320127^2 + 1^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 102481296130.
It is not an unprimeable number, because it can be changed into a prime (102481296131) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5124064797 + ... + 5124064816.
Almost surely, 2102481296130 is an apocalyptic number.
102481296130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102481296130 is a deficient number, since it is larger than the sum of its proper divisors (81985036922).
102481296130 is a wasteful number, since it uses less digits than its factorization.
102481296130 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10248129620.
The product of its (nonzero) digits is 20736, while the sum is 37.
The spelling of 102481296130 in words is "one hundred two billion, four hundred eighty-one million, two hundred ninety-six thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •