Base | Representation |
---|---|
bin | 101111100010111010… |
… | …1101011010100000001 |
3 | 100202112202121200022101 |
4 | 1133011311223110001 |
5 | 3133101434233101 |
6 | 114523342510401 |
7 | 10243134560440 |
oct | 1370565532401 |
9 | 322482550271 |
10 | 102103430401 |
11 | 3a3357a7535 |
12 | 17956295401 |
13 | 982252bb0b |
14 | 4d28560d57 |
15 | 29c8c2d401 |
hex | 17c5d6b501 |
102103430401 has 8 divisors (see below), whose sum is σ = 119843408960. Its totient is φ = 85151895408.
The previous prime is 102103430357. The next prime is 102103430419. The reversal of 102103430401 is 104034301201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102103430401 - 211 = 102103428353 is a prime.
It is a super-2 number, since 2×1021034304012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102103430441) 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 7 ways as a sum of consecutive naturals, for example, 197110611 + ... + 197111128.
It is an arithmetic number, because the mean of its divisors is an integer number (14980426120).
Almost surely, 2102103430401 is an apocalyptic number.
It is an amenable number.
102103430401 is a deficient number, since it is larger than the sum of its proper divisors (17739978559).
102103430401 is an equidigital number, since it uses as much as digits as its factorization.
102103430401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 394221783.
The product of its (nonzero) digits is 288, while the sum is 19.
Adding to 102103430401 its reverse (104034301201), we get a palindrome (206137731602).
The spelling of 102103430401 in words is "one hundred two billion, one hundred three million, four hundred thirty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •