Base | Representation |
---|---|
bin | 10101001001001110011… |
… | …001111000110111111010 |
3 | 12010220111001212002102011 |
4 | 111021032121320313322 |
5 | 142301233133333300 |
6 | 3031301112200134 |
7 | 206656023145060 |
oct | 25111631706772 |
9 | 5126431762364 |
10 | 1453014355450 |
11 | 5102467a6199 |
12 | 1b572b69904a |
13 | a7032016278 |
14 | 5047d3dc030 |
15 | 27be2481eba |
hex | 1524e678dfa |
1453014355450 has 24 divisors (see below), whose sum is σ = 3088693373472. Its totient is φ = 498176350320.
The previous prime is 1453014355433. The next prime is 1453014355477. The reversal of 1453014355450 is 545534103541.
It is a super-2 number, since 2×14530143554502 (a number of 25 digits) contains 22 as substring.
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 11 ways as a sum of consecutive naturals, for example, 2075734444 + ... + 2075735143.
It is an arithmetic number, because the mean of its divisors is an integer number (128695557228).
Almost surely, 21453014355450 is an apocalyptic number.
1453014355450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1453014355450 is an abundant number, since it is smaller than the sum of its proper divisors (1635679018022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1453014355450 is a wasteful number, since it uses less digits than its factorization.
1453014355450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4151469606 (or 4151469601 counting only the distinct ones).
The product of its (nonzero) digits is 360000, while the sum is 40.
Adding to 1453014355450 its reverse (545534103541), we get a palindrome (1998548458991).
The spelling of 1453014355450 in words is "one trillion, four hundred fifty-three billion, fourteen million, three hundred fifty-five thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •