Base | Representation |
---|---|
bin | 1100000010000110110100… |
… | …1011111010011110011000 |
3 | 1201211210210112010022111020 |
4 | 3000201231023322132120 |
5 | 3213231204231030240 |
6 | 44045532531402440 |
7 | 2533600636631361 |
oct | 300415513723630 |
9 | 51753715108436 |
10 | 13230331111320 |
11 | 4240a51aa8844 |
12 | 1598163153420 |
13 | 74c7cbb4122b |
14 | 33a4cc502b68 |
15 | 17e24083c0d0 |
hex | c086d2fa798 |
13230331111320 has 32 divisors (see below), whose sum is σ = 39690993334320. Its totient is φ = 3528088296320.
The previous prime is 13230331111273. The next prime is 13230331111343. The reversal of 13230331111320 is 2311113303231.
It is a super-2 number, since 2×132303311113202 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 55126379511 + ... + 55126379750.
Almost surely, 213230331111320 is an apocalyptic number.
13230331111320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13230331111320 is an abundant number, since it is smaller than the sum of its proper divisors (26460662223000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13230331111320 is a wasteful number, since it uses less digits than its factorization.
13230331111320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110252759275 (or 110252759271 counting only the distinct ones).
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 13230331111320 its reverse (2311113303231), we get a palindrome (15541444414551).
The spelling of 13230331111320 in words is "thirteen trillion, two hundred thirty billion, three hundred thirty-one million, one hundred eleven thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •