Base | Representation |
---|---|
bin | 10101000111101001001… |
… | …001101011000111110100 |
3 | 12010202002200100200021000 |
4 | 111013221021223013310 |
5 | 142234243243343004 |
6 | 3030420350123300 |
7 | 206565645051555 |
oct | 25075111530764 |
9 | 5122080320230 |
10 | 1451315606004 |
11 | 50a554907630 |
12 | 1b53367b0530 |
13 | a6b210b6c94 |
14 | 5035b96032c |
15 | 27b43278c39 |
hex | 151e926b1f4 |
1451315606004 has 96 divisors (see below), whose sum is σ = 4136065274880. Its totient is φ = 436435365600.
The previous prime is 1451315605997. The next prime is 1451315606017. The reversal of 1451315606004 is 4006065131541.
1451315606004 is a `hidden beast` number, since 1 + 4 + 5 + 1 + 31 + 560 + 60 + 0 + 4 = 666.
It is a super-3 number, since 3×14513156060043 (a number of 37 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 1451315606004.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4507144 + ... + 4818399.
It is an arithmetic number, because the mean of its divisors is an integer number (43084013280).
Almost surely, 21451315606004 is an apocalyptic number.
It is an amenable number.
1451315606004 is an abundant number, since it is smaller than the sum of its proper divisors (2684749668876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1451315606004 is a wasteful number, since it uses less digits than its factorization.
1451315606004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9325698 (or 9325690 counting only the distinct ones).
The product of its (nonzero) digits is 43200, while the sum is 36.
The spelling of 1451315606004 in words is "one trillion, four hundred fifty-one billion, three hundred fifteen million, six hundred six thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •