Base | Representation |
---|---|
bin | 10010110101010110… |
… | …10010110001100000 |
3 | 222002200001212021120 |
4 | 21122223102301200 |
5 | 131201433424440 |
6 | 4351154452240 |
7 | 505365030522 |
oct | 113253226140 |
9 | 28080055246 |
10 | 10111233120 |
11 | 431958910a |
12 | 1b62294080 |
13 | c51a64ba1 |
14 | 6bcc39a12 |
15 | 3e2a30dd0 |
hex | 25aad2c60 |
10111233120 has 96 divisors (see below), whose sum is σ = 32372615520. Its totient is φ = 2652119040.
The previous prime is 10111233101. The next prime is 10111233161. The reversal of 10111233120 is 2133211101.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10111233120.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 143385 + ... + 201944.
It is an arithmetic number, because the mean of its divisors is an integer number (337214745).
Almost surely, 210111233120 is an apocalyptic number.
10111233120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10111233120 is an abundant number, since it is smaller than the sum of its proper divisors (22261382400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10111233120 is a wasteful number, since it uses less digits than its factorization.
10111233120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345408 (or 345400 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 10111233120 its reverse (2133211101), we get a palindrome (12244444221).
The spelling of 10111233120 in words is "ten billion, one hundred eleven million, two hundred thirty-three thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •