Base | Representation |
---|---|
bin | 10111001100010010111011… |
… | …000010010110110000111010 |
3 | 111101011002212212020122112222 |
4 | 113030102323002112300322 |
5 | 101332132020423133310 |
6 | 1000534055104204042 |
7 | 30325154420542244 |
oct | 2714227302266072 |
9 | 441132785218488 |
10 | 102000021302330 |
11 | 2a555a69987798 |
12 | b534354909622 |
13 | 44bb739c28438 |
14 | 1b28b82449094 |
15 | bbd3c45a9055 |
hex | 5cc4bb096c3a |
102000021302330 has 8 divisors (see below), whose sum is σ = 183600038344212. Its totient is φ = 40800008520928.
The previous prime is 102000021302329. The next prime is 102000021302381. The reversal of 102000021302330 is 33203120000201.
It can be written as a sum of positive squares in 2 ways, for example, as 95540478819361 + 6459542482969 = 9774481^2 + 2541563^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 102000021302299 and 102000021302308.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5100001065107 + ... + 5100001065126.
Almost surely, 2102000021302330 is an apocalyptic number.
102000021302330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102000021302330 is a deficient number, since it is larger than the sum of its proper divisors (81600017041882).
102000021302330 is a wasteful number, since it uses less digits than its factorization.
102000021302330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10200002130240.
The product of its (nonzero) digits is 216, while the sum is 17.
Adding to 102000021302330 its reverse (33203120000201), we get a palindrome (135203141302531).
The spelling of 102000021302330 in words is "one hundred two trillion, twenty-one million, three hundred two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •