Base | Representation |
---|---|
bin | 1011110110100001000101… |
… | …1011101000001011100011 |
3 | 1201010202212100112000101222 |
4 | 2331220101123220023203 |
5 | 3202000421121344303 |
6 | 43414243350445255 |
7 | 2513321600603102 |
oct | 275502133501343 |
9 | 51122770460358 |
10 | 13031223231203 |
11 | 4174568877501 |
12 | 156565636382b |
13 | 736aba5b9a58 |
14 | 330a00aca039 |
15 | 178e8a889938 |
hex | bda116e82e3 |
13031223231203 has 8 divisors (see below), whose sum is σ = 13313338770240. Its totient is φ = 12749310003520.
The previous prime is 13031223231179. The next prime is 13031223231209. The reversal of 13031223231203 is 30213232213031.
13031223231203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13031223231203 - 218 = 13031222969059 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13031223231209) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50447618 + ... + 50705271.
It is an arithmetic number, because the mean of its divisors is an integer number (1664167346280).
Almost surely, 213031223231203 is an apocalyptic number.
13031223231203 is a deficient number, since it is larger than the sum of its proper divisors (282115539037).
13031223231203 is a wasteful number, since it uses less digits than its factorization.
13031223231203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101155677.
The product of its (nonzero) digits is 3888, while the sum is 26.
Adding to 13031223231203 its reverse (30213232213031), we get a palindrome (43244455444234).
The spelling of 13031223231203 in words is "thirteen trillion, thirty-one billion, two hundred twenty-three million, two hundred thirty-one thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •