Base | Representation |
---|---|
bin | 101111100000101111… |
… | …1001110000011000101 |
3 | 100202100200021002202112 |
4 | 1133001133032003011 |
5 | 3132424242401001 |
6 | 114512214150405 |
7 | 10241260245422 |
oct | 1370137160305 |
9 | 322320232675 |
10 | 102030434501 |
11 | 3a2a857a646 |
12 | 17935952405 |
13 | 9810381788 |
14 | 4d1c99cd49 |
15 | 29c260ecbb |
hex | 17c17ce0c5 |
102030434501 has 8 divisors (see below), whose sum is σ = 102120716544. Its totient is φ = 101940191280.
The previous prime is 102030434497. The next prime is 102030434537. The reversal of 102030434501 is 105434030201.
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 102030434501 - 22 = 102030434497 is a prime.
It is a super-2 number, since 2×1020304345012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102030434591) 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, 7766000 + ... + 7779126.
It is an arithmetic number, because the mean of its divisors is an integer number (12765089568).
Almost surely, 2102030434501 is an apocalyptic number.
It is an amenable number.
102030434501 is a deficient number, since it is larger than the sum of its proper divisors (90282043).
102030434501 is a wasteful number, since it uses less digits than its factorization.
102030434501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19411.
The product of its (nonzero) digits is 1440, while the sum is 23.
Adding to 102030434501 its reverse (105434030201), we get a palindrome (207464464702).
The spelling of 102030434501 in words is "one hundred two billion, thirty million, four hundred thirty-four thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •