Base | Representation |
---|---|
bin | 100100110000001001110… |
… | …1001100011101110101010 |
3 | 122212220001121000201002000 |
4 | 1021200103221203232222 |
5 | 1130224340031421300 |
6 | 14424254442151430 |
7 | 1030636502535351 |
oct | 111402351435652 |
9 | 18786047021060 |
10 | 5051211201450 |
11 | 1678230047147 |
12 | 696b604b2576 |
13 | 2a8433a4ab2b |
14 | 1366a0cc0998 |
15 | 8b5d85b5c00 |
hex | 49813a63baa |
5051211201450 has 48 divisors (see below), whose sum is σ = 13918893092160. Its totient is φ = 1346989653360.
The previous prime is 5051211201437. The next prime is 5051211201493. The reversal of 5051211201450 is 541021121505.
It is a happy number.
5051211201450 is a `hidden beast` number, since 5 + 0 + 5 + 1 + 2 + 1 + 1 + 201 + 450 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1870817614 + ... + 1870820313.
It is an arithmetic number, because the mean of its divisors is an integer number (289976939420).
Almost surely, 25051211201450 is an apocalyptic number.
5051211201450 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5051211201450 is an abundant number, since it is smaller than the sum of its proper divisors (8867681890710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5051211201450 is a wasteful number, since it uses less digits than its factorization.
5051211201450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3741637948 (or 3741637937 counting only the distinct ones).
The product of its (nonzero) digits is 2000, while the sum is 27.
Adding to 5051211201450 its reverse (541021121505), we get a palindrome (5592232322955).
The spelling of 5051211201450 in words is "five trillion, fifty-one billion, two hundred eleven million, two hundred one thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •