Base | Representation |
---|---|
bin | 10101000111110101010… |
… | …101011011101011000101 |
3 | 12010202121220222201202020 |
4 | 111013311111123223011 |
5 | 142240203110440140 |
6 | 3030452531233353 |
7 | 206604006361362 |
oct | 25076525335305 |
9 | 5122556881666 |
10 | 1451520015045 |
11 | 50a64a231121 |
12 | 1b5393148859 |
13 | a6b54556089 |
14 | 5037ab6d469 |
15 | 27b561a46d0 |
hex | 151f555bac5 |
1451520015045 has 16 divisors (see below), whose sum is σ = 2325123159552. Its totient is φ = 773246962880.
The previous prime is 1451520015031. The next prime is 1451520015097. The reversal of 1451520015045 is 5405100251541.
It is a happy number.
It is not a de Polignac number, because 1451520015045 - 211 = 1451520012997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1451520014997 and 1451520015015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 56051946 + ... + 56077835.
It is an arithmetic number, because the mean of its divisors is an integer number (145320197472).
Almost surely, 21451520015045 is an apocalyptic number.
1451520015045 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1451520015045 is a deficient number, since it is larger than the sum of its proper divisors (873603144507).
1451520015045 is a wasteful number, since it uses less digits than its factorization.
1451520015045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112130652.
The product of its (nonzero) digits is 20000, while the sum is 33.
Adding to 1451520015045 its reverse (5405100251541), we get a palindrome (6856620266586).
The spelling of 1451520015045 in words is "one trillion, four hundred fifty-one billion, five hundred twenty million, fifteen thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •