Base | Representation |
---|---|
bin | 10111001100011100010011… |
… | …111110001111110110001001 |
3 | 111101012001220111100211112220 |
4 | 113030130103332033312021 |
5 | 101332313142423112413 |
6 | 1000542443341124253 |
7 | 30325662312433365 |
oct | 2714342376176611 |
9 | 441161814324486 |
10 | 102010103332233 |
11 | 2a55a272a2a008 |
12 | b5362a9259689 |
13 | 44bc685906bc5 |
14 | 1b2945b4422a5 |
15 | bbd7b476c223 |
hex | 5cc713f8fd89 |
102010103332233 has 8 divisors (see below), whose sum is σ = 140703590803200. Its totient is φ = 65661675708048.
The previous prime is 102010103332201. The next prime is 102010103332283. The reversal of 102010103332233 is 332233301010201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102010103332233 - 25 = 102010103332201 is a prime.
It is a super-2 number, since 2×1020101033322332 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102010103332283) 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, 586264961593 + ... + 586264961766.
It is an arithmetic number, because the mean of its divisors is an integer number (17587948850400).
Almost surely, 2102010103332233 is an apocalyptic number.
It is an amenable number.
102010103332233 is a deficient number, since it is larger than the sum of its proper divisors (38693487470967).
102010103332233 is a wasteful number, since it uses less digits than its factorization.
102010103332233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1172529923391.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 102010103332233 its reverse (332233301010201), we get a palindrome (434243404342434).
The spelling of 102010103332233 in words is "one hundred two trillion, ten billion, one hundred three million, three hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •