Base | Representation |
---|---|
bin | 1010010011000101011110… |
… | …0000110100011000100100 |
3 | 1111002110122110221001021002 |
4 | 2210301113200310120210 |
5 | 2441004002003410340 |
6 | 40025414301412432 |
7 | 2246026355042012 |
oct | 244612740643044 |
9 | 44073573831232 |
10 | 11323002013220 |
11 | 36760704a0197 |
12 | 132a58256a118 |
13 | 6419a6868271 |
14 | 2b207156b8b2 |
15 | 14980d424715 |
hex | a4c57834624 |
11323002013220 has 48 divisors (see below), whose sum is σ = 25099515100800. Its totient is φ = 4278869614080.
The previous prime is 11323002013189. The next prime is 11323002013241. The reversal of 11323002013220 is 2231020032311.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 11323002013192 and 11323002013201.
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, 41364101 + ... + 41636940.
It is an arithmetic number, because the mean of its divisors is an integer number (522906564600).
Almost surely, 211323002013220 is an apocalyptic number.
11323002013220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11323002013220 is an abundant number, since it is smaller than the sum of its proper divisors (13776513087580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11323002013220 is a wasteful number, since it uses less digits than its factorization.
11323002013220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83001428 (or 83001426 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 11323002013220 its reverse (2231020032311), we get a palindrome (13554022045531).
The spelling of 11323002013220 in words is "eleven trillion, three hundred twenty-three billion, two million, thirteen thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •