Base | Representation |
---|---|
bin | 11110000000010010101… |
… | …00010100110000100000 |
3 | 10122120001120102210102200 |
4 | 33000021110110300200 |
5 | 113342340302131023 |
6 | 2105340003413200 |
7 | 134324602303614 |
oct | 17001124246040 |
9 | 3576046383380 |
10 | 1030948473888 |
11 | 36824a59a443 |
12 | 14797a684200 |
13 | 762aacc9b98 |
14 | 37c80829344 |
15 | 1bc3d794743 |
hex | f009514c20 |
1030948473888 has 72 divisors (see below), whose sum is σ = 2933129541888. Its totient is φ = 343488926592.
The previous prime is 1030948473871. The next prime is 1030948473923. The reversal of 1030948473888 is 8883748490301.
1030948473888 is a `hidden beast` number, since 1 + 0 + 3 + 0 + 9 + 484 + 73 + 8 + 88 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 218020 + ... + 1452387.
It is an arithmetic number, because the mean of its divisors is an integer number (40737910304).
Almost surely, 21030948473888 is an apocalyptic number.
1030948473888 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
1030948473888 is an abundant number, since it is smaller than the sum of its proper divisors (1902181068000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030948473888 is a wasteful number, since it uses less digits than its factorization.
1030948473888 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1672566 (or 1672555 counting only the distinct ones).
The product of its (nonzero) digits is 37158912, while the sum is 63.
The spelling of 1030948473888 in words is "one trillion, thirty billion, nine hundred forty-eight million, four hundred seventy-three thousand, eight hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •