Base | Representation |
---|---|
bin | 10100111011000101… |
… | …01111001000011010 |
3 | 1001222211222202012001 |
4 | 22131202233020122 |
5 | 141001131012300 |
6 | 5054351311214 |
7 | 545236315060 |
oct | 123542571032 |
9 | 31884882161 |
10 | 11233063450 |
11 | 4844853914 |
12 | 2215b1b50a |
13 | 10a02ba10b |
14 | 787c1c030 |
15 | 45b27a16a |
hex | 29d8af21a |
11233063450 has 96 divisors (see below), whose sum is σ = 24631423488. Its totient is φ = 3731520000.
The previous prime is 11233063417. The next prime is 11233063459. The reversal of 11233063450 is 5436033211.
11233063450 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (11233063459) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1658070 + ... + 1664830.
It is an arithmetic number, because the mean of its divisors is an integer number (256577328).
Almost surely, 211233063450 is an apocalyptic number.
11233063450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11233063450 is an abundant number, since it is smaller than the sum of its proper divisors (13398360038).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11233063450 is a wasteful number, since it uses less digits than its factorization.
11233063450 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6928 (or 6923 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 11233063450 its reverse (5436033211), we get a palindrome (16669096661).
The spelling of 11233063450 in words is "eleven billion, two hundred thirty-three million, sixty-three thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •