Base | Representation |
---|---|
bin | 100110101110011011111… |
… | …1000101111001110110110 |
3 | 200211211001100112202100021 |
4 | 1031130313320233032312 |
5 | 1144200234414201100 |
6 | 15153024444235354 |
7 | 1056350041253032 |
oct | 115346770571666 |
9 | 20754040482307 |
10 | 5322402100150 |
11 | 177224425a213 |
12 | 71b62583bb5a |
13 | 2c7b92140325 |
14 | 145869c191c2 |
15 | 936ab989a1a |
hex | 4d737e2f3b6 |
5322402100150 has 12 divisors (see below), whose sum is σ = 9899667906372. Its totient is φ = 2128960840040.
The previous prime is 5322402100139. The next prime is 5322402100153. The reversal of 5322402100150 is 510012042235.
It is a super-2 number, since 2×53224021001502 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5322402100153) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 53224020952 + ... + 53224021051.
It is an arithmetic number, because the mean of its divisors is an integer number (824972325531).
Almost surely, 25322402100150 is an apocalyptic number.
5322402100150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5322402100150 is a deficient number, since it is larger than the sum of its proper divisors (4577265806222).
5322402100150 is a wasteful number, since it uses less digits than its factorization.
5322402100150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106448042015 (or 106448042010 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 25.
Adding to 5322402100150 its reverse (510012042235), we get a palindrome (5832414142385).
The spelling of 5322402100150 in words is "five trillion, three hundred twenty-two billion, four hundred two million, one hundred thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •