Base | Representation |
---|---|
bin | 10111010010100011101011… |
… | …000001001100100001011001 |
3 | 111102200020120022212111020101 |
4 | 113102203223001030201121 |
5 | 101411204300144043301 |
6 | 1001503501335455401 |
7 | 30401226615114001 |
oct | 2722435301144131 |
9 | 442606508774211 |
10 | 102430323034201 |
11 | 2a701501aaa7a8 |
12 | b5a3823b27561 |
13 | 45201a42b4a26 |
14 | 1b41922b5b001 |
15 | bc96ab32d701 |
hex | 5d28eb04c859 |
102430323034201 has 8 divisors (see below), whose sum is σ = 107989077583520. Its totient is φ = 96888336976512.
The previous prime is 102430323034139. The next prime is 102430323034229.
It is a happy number.
102430323034201 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102430323034201 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102430323034201.
It is not an unprimeable number, because it can be changed into a prime (102430323034601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4192110360 + ... + 4192134793.
It is an arithmetic number, because the mean of its divisors is an integer number (13498634697940).
Almost surely, 2102430323034201 is an apocalyptic number.
It is an amenable number.
102430323034201 is a deficient number, since it is larger than the sum of its proper divisors (5558754549319).
102430323034201 is an equidigital number, since it uses as much as digits as its factorization.
102430323034201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8384245815.
The product of its (nonzero) digits is 10368, while the sum is 28.
The spelling of 102430323034201 in words is "one hundred two trillion, four hundred thirty billion, three hundred twenty-three million, thirty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •