Base | Representation |
---|---|
bin | 110011011000000101… |
… | …1100101111001011110 |
3 | 101112210002101021200020 |
4 | 1212300023211321132 |
5 | 3301423440324410 |
6 | 122403535013010 |
7 | 10654036423215 |
oct | 1466013457136 |
9 | 345702337606 |
10 | 110330011230 |
11 | 4287746246a |
12 | 1947136a166 |
13 | a5339a4b1a |
14 | 54a8d6a07c |
15 | 2d0b083a70 |
hex | 19b02e5e5e |
110330011230 has 32 divisors (see below), whose sum is σ = 276304725504. Its totient is φ = 28142147616.
The previous prime is 110330011219. The next prime is 110330011247. The reversal of 110330011230 is 32110033011.
110330011230 is digitally balanced in base 7, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×1103300112302 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 79948594 + ... + 79949973.
It is an arithmetic number, because the mean of its divisors is an integer number (8634522672).
Almost surely, 2110330011230 is an apocalyptic number.
110330011230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
110330011230 is an abundant number, since it is smaller than the sum of its proper divisors (165974714274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110330011230 is a wasteful number, since it uses less digits than its factorization.
110330011230 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 159898600.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 110330011230 its reverse (32110033011), we get a palindrome (142440044241).
The spelling of 110330011230 in words is "one hundred ten billion, three hundred thirty million, eleven thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •