Base | Representation |
---|---|
bin | 110011100111010100100111… |
… | …0100011110110010011100110 |
3 | 2012112111110121012000110111110 |
4 | 1213032221032203312103212 |
5 | 434001410002014330202 |
6 | 4245331024453445450 |
7 | 164425534244266323 |
oct | 14716511643662346 |
9 | 2175443535013443 |
10 | 454005131011302 |
11 | 121729549626062 |
12 | 42b0529b940886 |
13 | 16643666aa8c00 |
14 | 8017d737d7b4a |
15 | 3774aae42d26c |
hex | 19cea4e8f64e6 |
454005131011302 has 48 divisors (see below), whose sum is σ = 994277575858320. Its totient is φ = 138124292207616.
The previous prime is 454005131011283. The next prime is 454005131011349. The reversal of 454005131011302 is 203110131500454.
It is a super-2 number, since 2×4540051310113022 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 454005131011302.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2515285123 + ... + 2515465614.
It is an arithmetic number, because the mean of its divisors is an integer number (20714116163715).
Almost surely, 2454005131011302 is an apocalyptic number.
454005131011302 is an abundant number, since it is smaller than the sum of its proper divisors (540272444847018).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
454005131011302 is a wasteful number, since it uses less digits than its factorization.
454005131011302 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5030750857 (or 5030750844 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 30.
Adding to 454005131011302 its reverse (203110131500454), we get a palindrome (657115262511756).
The spelling of 454005131011302 in words is "four hundred fifty-four trillion, five billion, one hundred thirty-one million, eleven thousand, three hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •