Base | Representation |
---|---|
bin | 11101111111001001000… |
… | …10000001111110110000 |
3 | 10122111110120010121201220 |
4 | 32333210202001332300 |
5 | 113340104303410000 |
6 | 2105154435425040 |
7 | 134303366430156 |
oct | 16774442017660 |
9 | 3574416117656 |
10 | 1030331310000 |
11 | 367a63189043 |
12 | 147827a55180 |
13 | 762101a1a55 |
14 | 37c228953d6 |
15 | 1bc044d61a0 |
hex | efe4881fb0 |
1030331310000 has 100 divisors (see below), whose sum is σ = 3326046943032. Its totient is φ = 274755008000.
The previous prime is 1030331309941. The next prime is 1030331310007. The reversal of 1030331310000 is 131330301.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×10303313100002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is not an unprimeable number, because it can be changed into a prime (1030331310007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 17142189 + ... + 17202188.
Almost surely, 21030331310000 is an apocalyptic number.
1030331310000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1030331310000 is an abundant number, since it is smaller than the sum of its proper divisors (2295715633032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1030331310000 is an equidigital number, since it uses as much as digits as its factorization.
1030331310000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34344408 (or 34344387 counting only the distinct ones).
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 1030331310000 its reverse (131330301), we get a palindrome (1030462640301).
The spelling of 1030331310000 in words is "one trillion, thirty billion, three hundred thirty-one million, three hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •