Base | Representation |
---|---|
bin | 10010010001000110111… |
… | …101101010011111110000 |
3 | 11110000012110222010100221 |
4 | 102101012331222133300 |
5 | 131031344140123100 |
6 | 2400404142022424 |
7 | 156460011421546 |
oct | 22210675523760 |
9 | 4400173863327 |
10 | 1255321020400 |
11 | 444418a98567 |
12 | 183358577a14 |
13 | 914b7863ac5 |
14 | 44a87801d96 |
15 | 229c179901a |
hex | 12446f6a7f0 |
1255321020400 has 180 divisors, whose sum is σ = 3156337891168. Its totient is φ = 479748234240.
The previous prime is 1255321020397. The next prime is 1255321020413. The reversal of 1255321020400 is 40201235521.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 218579929 + ... + 218585671.
Almost surely, 21255321020400 is an apocalyptic number.
1255321020400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1255321020400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1578168945584).
1255321020400 is an abundant number, since it is smaller than the sum of its proper divisors (1901016870768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1255321020400 is a wasteful number, since it uses less digits than its factorization.
1255321020400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6840 (or 6806 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 1255321020400 its reverse (40201235521), we get a palindrome (1295522255921).
The spelling of 1255321020400 in words is "one trillion, two hundred fifty-five billion, three hundred twenty-one million, twenty thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •