Base | Representation |
---|---|
bin | 11110000000101000011… |
… | …00110111011000000000 |
3 | 10122120112022000112100000 |
4 | 33000110030313120000 |
5 | 113343224023133104 |
6 | 2105410045200000 |
7 | 134332250314650 |
oct | 17002414673000 |
9 | 3576468015300 |
10 | 1031131067904 |
11 | 368333673a93 |
12 | 147a0b860000 |
13 | 76309a9b692 |
14 | 37c9ab9a360 |
15 | 1bc4e811639 |
hex | f014337600 |
1031131067904 has 960 divisors, whose sum is σ = 3648411486720. Its totient is φ = 284663808000.
The previous prime is 1031131067893. The next prime is 1031131067983. The reversal of 1031131067904 is 4097601311301.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 4108091779 + ... + 4108092029.
It is an arithmetic number, because the mean of its divisors is an integer number (3800428632).
Almost surely, 21031131067904 is an apocalyptic number.
1031131067904 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1031131067904, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1824205743360).
1031131067904 is an abundant number, since it is smaller than the sum of its proper divisors (2617280418816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1031131067904 is an frugal number, since it uses more digits than its factorization.
1031131067904 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 433 (or 405 counting only the distinct ones).
The product of its (nonzero) digits is 13608, while the sum is 36.
The spelling of 1031131067904 in words is "one trillion, thirty-one billion, one hundred thirty-one million, sixty-seven thousand, nine hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •