Base | Representation |
---|---|
bin | 10011100010010000010… |
… | …101010011110001001010 |
3 | 11202100002201222000011020 |
4 | 103202100111103301022 |
5 | 133443320013121300 |
6 | 2504414050213310 |
7 | 165663123533550 |
oct | 23422025236112 |
9 | 4670081860136 |
10 | 1342451301450 |
11 | 47836a8422a6 |
12 | 198214284236 |
13 | 99791c8821c |
14 | 48d9152bbd0 |
15 | 24dc0c188a0 |
hex | 13890553c4a |
1342451301450 has 48 divisors (see below), whose sum is σ = 3804890548800. Its totient is φ = 306846011520.
The previous prime is 1342451301449. The next prime is 1342451301491. The reversal of 1342451301450 is 541031542431.
It is a super-3 number, since 3×13424513014503 (a number of 37 digits) contains 333 as substring.
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 639261475 + ... + 639263574.
It is an arithmetic number, because the mean of its divisors is an integer number (79268553100).
Almost surely, 21342451301450 is an apocalyptic number.
1342451301450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1342451301450 is an abundant number, since it is smaller than the sum of its proper divisors (2462439247350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1342451301450 is a wasteful number, since it uses less digits than its factorization.
1342451301450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1278525071 (or 1278525066 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 33.
Adding to 1342451301450 its reverse (541031542431), we get a palindrome (1883482843881).
The spelling of 1342451301450 in words is "one trillion, three hundred forty-two billion, four hundred fifty-one million, three hundred one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •