Base | Representation |
---|---|
bin | 11011101100001010101… |
… | …001101110001000001010 |
3 | 20201220120211111221022220 |
4 | 123230022221232020022 |
5 | 222134013400034010 |
6 | 4014053514354510 |
7 | 254322243336504 |
oct | 33541251561012 |
9 | 6656524457286 |
10 | 1902849221130 |
11 | 673aa28617a0 |
12 | 26895042ba36 |
13 | 10a5901268c0 |
14 | 68153dc6d74 |
15 | 3476dea1970 |
hex | 1bb0aa6e20a |
1902849221130 has 128 divisors (see below), whose sum is σ = 5367661883136. Its totient is φ = 425619916800.
The previous prime is 1902849221123. The next prime is 1902849221191. The reversal of 1902849221130 is 311229482091.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 9497590 + ... + 9695870.
It is an arithmetic number, because the mean of its divisors is an integer number (41934858462).
Almost surely, 21902849221130 is an apocalyptic number.
1902849221130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1902849221130, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2683830941568).
1902849221130 is an abundant number, since it is smaller than the sum of its proper divisors (3464812662006).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1902849221130 is a wasteful number, since it uses less digits than its factorization.
1902849221130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200552.
The product of its (nonzero) digits is 62208, while the sum is 42.
The spelling of 1902849221130 in words is "one trillion, nine hundred two billion, eight hundred forty-nine million, two hundred twenty-one thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •