Base | Representation |
---|---|
bin | 101111100001000100… |
… | …0101101011100110110 |
3 | 100202101102201200112221 |
4 | 1133002020231130312 |
5 | 3132440033423110 |
6 | 114513243232554 |
7 | 10241451555421 |
oct | 1370210553466 |
9 | 322342650487 |
10 | 102041311030 |
11 | 3a30372930a |
12 | 1793951875a |
13 | 98126bc2a9 |
14 | 4d201d09b8 |
15 | 29c355c7da |
hex | 17c222d736 |
102041311030 has 32 divisors (see below), whose sum is σ = 185162858496. Its totient is φ = 40485894624.
The previous prime is 102041311007. The next prime is 102041311033. The reversal of 102041311030 is 30113140201.
102041311030 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 102041310995 and 102041311013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102041311033) 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 15 ways as a sum of consecutive naturals, for example, 9198147 + ... + 9209233.
It is an arithmetic number, because the mean of its divisors is an integer number (5786339328).
Almost surely, 2102041311030 is an apocalyptic number.
102041311030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102041311030 is a deficient number, since it is larger than the sum of its proper divisors (83121547466).
102041311030 is a wasteful number, since it uses less digits than its factorization.
102041311030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18468.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102041311030 its reverse (30113140201), we get a palindrome (132154451231).
The spelling of 102041311030 in words is "one hundred two billion, forty-one million, three hundred eleven thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •