Base | Representation |
---|---|
bin | 110000001010011101… |
… | …1101101101011001010 |
3 | 100212222020120101020010 |
4 | 1200110323231223022 |
5 | 3143311141204002 |
6 | 115303144412350 |
7 | 10321050001410 |
oct | 1402473555312 |
9 | 325866511203 |
10 | 103430413002 |
11 | 3a956854174 |
12 | 180667770b6 |
13 | 99a4423517 |
14 | 50128a72b0 |
15 | 2a5549d46c |
hex | 1814eedaca |
103430413002 has 16 divisors (see below), whose sum is σ = 236412372672. Its totient is φ = 29551546560.
The previous prime is 103430412991. The next prime is 103430413013. The reversal of 103430413002 is 200314034301.
It is an interprime number because it is at equal distance from previous prime (103430412991) and next prime (103430413013).
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a self number, because there is not a number n which added to its sum of digits gives 103430413002.
It is an unprimeable number.
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, 1231314399 + ... + 1231314482.
It is an arithmetic number, because the mean of its divisors is an integer number (14775773292).
Almost surely, 2103430413002 is an apocalyptic number.
103430413002 is an abundant number, since it is smaller than the sum of its proper divisors (132981959670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103430413002 is a wasteful number, since it uses less digits than its factorization.
103430413002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2462628893.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 103430413002 its reverse (200314034301), we get a palindrome (303744447303).
The spelling of 103430413002 in words is "one hundred three billion, four hundred thirty million, four hundred thirteen thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •