Base | Representation |
---|---|
bin | 10111001110001111000011… |
… | …101110010010010011111010 |
3 | 111101121211221001100222122021 |
4 | 113032033003232102103322 |
5 | 101341323010110203310 |
6 | 1001115221221345054 |
7 | 30340613441505100 |
oct | 2716170356222372 |
9 | 441554831328567 |
10 | 102133311022330 |
11 | 2a5a754850a185 |
12 | b55615326818a |
13 | 44cb18c523143 |
14 | 1b313c87b5c70 |
15 | bc1ac613e5da |
hex | 5ce3c3b924fa |
102133311022330 has 48 divisors (see below), whose sum is σ = 213877531355400. Its totient is φ = 35013388088448.
The previous prime is 102133311022319. The next prime is 102133311022343. The reversal of 102133311022330 is 33220113331201.
It can be written as a sum of positive squares in 4 ways, for example, as 102014221843681 + 119089178649 = 10100209^2 + 345093^2 .
It is a junction number, because it is equal to n+sod(n) for n = 102133311022295 and 102133311022304.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6566457 + ... + 15728476.
Almost surely, 2102133311022330 is an apocalyptic number.
102133311022330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102133311022330 is an abundant number, since it is smaller than the sum of its proper divisors (111744220333070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102133311022330 is a wasteful number, since it uses less digits than its factorization.
102133311022330 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22304303 (or 22304296 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 102133311022330 its reverse (33220113331201), we get a palindrome (135353424353531).
The spelling of 102133311022330 in words is "one hundred two trillion, one hundred thirty-three billion, three hundred eleven million, twenty-two thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •