Base | Representation |
---|---|
bin | 1100000110110100001100… |
… | …1000101011110001100111 |
3 | 1202010112121111122200021002 |
4 | 3001231003020223301213 |
5 | 3221042344340001411 |
6 | 44151032235343515 |
7 | 2542463455063352 |
oct | 301550310536147 |
9 | 52115544580232 |
10 | 13311230000231 |
11 | 4272296348419 |
12 | 15ab97bbb1b9b |
13 | 757322270a77 |
14 | 3403a47c9299 |
15 | 1813c7bb833b |
hex | c1b4322bc67 |
13311230000231 has 4 divisors (see below), whose sum is σ = 13311858532200. Its totient is φ = 13310601468264.
The previous prime is 13311230000221. The next prime is 13311230000269. The reversal of 13311230000231 is 13200003211331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13311230000231 - 214 = 13311229983847 is a prime.
It is a super-2 number, since 2×133112300002312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13311230000221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 314234216 + ... + 314276573.
It is an arithmetic number, because the mean of its divisors is an integer number (3327964633050).
Almost surely, 213311230000231 is an apocalyptic number.
13311230000231 is a deficient number, since it is larger than the sum of its proper divisors (628531969).
13311230000231 is an equidigital number, since it uses as much as digits as its factorization.
13311230000231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628531968.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 13311230000231 its reverse (13200003211331), we get a palindrome (26511233211562).
The spelling of 13311230000231 in words is "thirteen trillion, three hundred eleven billion, two hundred thirty million, two hundred thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •