Base | Representation |
---|---|
bin | 10101001011100100000… |
… | …011011010010001101000 |
3 | 12011010222001011100111001 |
4 | 111023210003122101220 |
5 | 142321403402422402 |
6 | 3032354201044344 |
7 | 210105160515520 |
oct | 25134403322150 |
9 | 5133861140431 |
10 | 1455525045352 |
11 | 511314a40724 |
12 | 1b61104866b4 |
13 | a73422192b1 |
14 | 5063aa32680 |
15 | 27cdcac0187 |
hex | 152e40da468 |
1455525045352 has 32 divisors (see below), whose sum is σ = 3254590166400. Its totient is φ = 596674862784.
The previous prime is 1455525045319. The next prime is 1455525045353. The reversal of 1455525045352 is 2535405255541.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is not an unprimeable number, because it can be changed into a prime (1455525045353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 565031727 + ... + 565034302.
It is an arithmetic number, because the mean of its divisors is an integer number (101705942700).
Almost surely, 21455525045352 is an apocalyptic number.
It is an amenable number.
1455525045352 is an abundant number, since it is smaller than the sum of its proper divisors (1799065121048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1455525045352 is a wasteful number, since it uses less digits than its factorization.
1455525045352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1130066065 (or 1130066061 counting only the distinct ones).
The product of its (nonzero) digits is 3000000, while the sum is 46.
The spelling of 1455525045352 in words is "one trillion, four hundred fifty-five billion, five hundred twenty-five million, forty-five thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •