Base | Representation |
---|---|
bin | 11101001110100100100… |
… | …01011000011110010100 |
3 | 10120000011021020112201000 |
4 | 32213102101120132110 |
5 | 112423203304331040 |
6 | 2045203133103300 |
7 | 132361243643031 |
oct | 16472221303624 |
9 | 3500137215630 |
10 | 1004255152020 |
11 | 3579a194165a |
12 | 14276b027b30 |
13 | 73915a14983 |
14 | 3686b618388 |
15 | 1b1ca0dc130 |
hex | e9d2458794 |
1004255152020 has 96 divisors (see below), whose sum is σ = 3132863193600. Its totient is φ = 267071617152.
The previous prime is 1004255152003. The next prime is 1004255152057. The reversal of 1004255152020 is 202515524001.
1004255152020 is a `hidden beast` number, since 1 + 0 + 0 + 42 + 551 + 52 + 0 + 20 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent 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 31 ways as a sum of consecutive naturals, for example, 2335515 + ... + 2731874.
It is an arithmetic number, because the mean of its divisors is an integer number (32633991600).
Almost surely, 21004255152020 is an apocalyptic number.
1004255152020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1004255152020 is an abundant number, since it is smaller than the sum of its proper divisors (2128608041580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1004255152020 is a wasteful number, since it uses less digits than its factorization.
1004255152020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5067774 (or 5067766 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The spelling of 1004255152020 in words is "one trillion, four billion, two hundred fifty-five million, one hundred fifty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •