Base | Representation |
---|---|
bin | 10011100100011011… |
… | …11110100000111110 |
3 | 1000010012021022120010 |
4 | 21302031332200332 |
5 | 133004041414100 |
6 | 4454304204050 |
7 | 521232144024 |
oct | 116215764076 |
9 | 30105238503 |
10 | 10506201150 |
11 | 4501527475 |
12 | 2052609626 |
13 | cb5833c93 |
14 | 719490714 |
15 | 41754d750 |
hex | 27237e83e |
10506201150 has 48 divisors (see below), whose sum is σ = 26061639984. Its totient is φ = 2800980480.
The previous prime is 10506201109. The next prime is 10506201151. The reversal of 10506201150 is 5110260501.
It is a super-2 number, since 2×105062011502 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10506201151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1125904 + ... + 1135196.
It is an arithmetic number, because the mean of its divisors is an integer number (542950833).
Almost surely, 210506201150 is an apocalyptic number.
10506201150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10506201150 is an abundant number, since it is smaller than the sum of its proper divisors (15555438834).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10506201150 is a wasteful number, since it uses less digits than its factorization.
10506201150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16845 (or 16840 counting only the distinct ones).
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 10506201150 its reverse (5110260501), we get a palindrome (15616461651).
The spelling of 10506201150 in words is "ten billion, five hundred six million, two hundred one thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •