Base | Representation |
---|---|
bin | 10111001101110011000111… |
… | …000011011101010100100110 |
3 | 111101111222110200100110102211 |
4 | 113031303013003131110212 |
5 | 101340330030321224110 |
6 | 1001053335350554034 |
7 | 30335502003243652 |
oct | 2715630703352446 |
9 | 441458420313384 |
10 | 102103302133030 |
11 | 2a595849254520 |
12 | b55037936891a |
13 | 44c83b9367c03 |
14 | 1b2db7d0d5a62 |
15 | bc0e1b85b98a |
hex | 5cdcc70dd526 |
102103302133030 has 32 divisors (see below), whose sum is σ = 203317612662528. Its totient is φ = 36605537253600.
The previous prime is 102103302133013. The next prime is 102103302133033. The reversal of 102103302133030 is 30331203301201.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 102103302132992 and 102103302133010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102103302133033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6536695272 + ... + 6536710891.
It is an arithmetic number, because the mean of its divisors is an integer number (6353675395704).
Almost surely, 2102103302133030 is an apocalyptic number.
102103302133030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102103302133030 is a deficient number, since it is larger than the sum of its proper divisors (101214310529498).
102103302133030 is a wasteful number, since it uses less digits than its factorization.
102103302133030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13073406252.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 102103302133030 its reverse (30331203301201), we get a palindrome (132434505434231).
The spelling of 102103302133030 in words is "one hundred two trillion, one hundred three billion, three hundred two million, one hundred thirty-three thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •