Base | Representation |
---|---|
bin | 11101001110100000100… |
… | …11011111101001010100 |
3 | 10120000001222010221011100 |
4 | 32213100103133221110 |
5 | 112423121332320002 |
6 | 2045155553510100 |
7 | 132360363305625 |
oct | 16472023375124 |
9 | 3500058127140 |
10 | 1004222151252 |
11 | 3579852516a1 |
12 | 14275bb72330 |
13 | 7390bc2bba8 |
14 | 368670a7a4c |
15 | 1b1c726e11c |
hex | e9d04dfa54 |
1004222151252 has 36 divisors (see below), whose sum is σ = 2581475027040. Its totient is φ = 329067144912.
The previous prime is 1004222151223. The next prime is 1004222151263. The reversal of 1004222151252 is 2521512224001.
1004222151252 is a `hidden beast` number, since 1 + 0 + 0 + 422 + 215 + 1 + 25 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 236396688 + ... + 236400935.
It is an arithmetic number, because the mean of its divisors is an integer number (71707639640).
Almost surely, 21004222151252 is an apocalyptic number.
1004222151252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1004222151252 is an abundant number, since it is smaller than the sum of its proper divisors (1577252875788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1004222151252 is a wasteful number, since it uses less digits than its factorization.
1004222151252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 472797692 (or 472797687 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
Adding to 1004222151252 its reverse (2521512224001), we get a palindrome (3525734375253).
The spelling of 1004222151252 in words is "one trillion, four billion, two hundred twenty-two million, one hundred fifty-one thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •