Base | Representation |
---|---|
bin | 10010010000000000000… |
… | …011011100011001110000 |
3 | 11102220010120101202202210 |
4 | 102100000003130121300 |
5 | 131021430111300300 |
6 | 2400050123212120 |
7 | 156415354420215 |
oct | 22200003343160 |
9 | 4386116352683 |
10 | 1254131353200 |
11 | 4439684a9a30 |
12 | 183086077040 |
13 | 9135824980b |
14 | 449b3801b0c |
15 | 22952100050 |
hex | 124000dc670 |
1254131353200 has 120 divisors (see below), whose sum is σ = 4382619065856. Its totient is φ = 304031840000.
The previous prime is 1254131353183. The next prime is 1254131353229. The reversal of 1254131353200 is 23531314521.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 47491776 + ... + 47518175.
Almost surely, 21254131353200 is an apocalyptic number.
1254131353200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1254131353200 is an abundant number, since it is smaller than the sum of its proper divisors (3128487712656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1254131353200 is a wasteful number, since it uses less digits than its factorization.
1254131353200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95009983 (or 95009972 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
Adding to 1254131353200 its reverse (23531314521), we get a palindrome (1277662667721).
The spelling of 1254131353200 in words is "one trillion, two hundred fifty-four billion, one hundred thirty-one million, three hundred fifty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •