Base | Representation |
---|---|
bin | 10110011000000110… |
… | …11111110110001011 |
3 | 1011000020100010112112 |
4 | 23030003133312023 |
5 | 144100412403111 |
6 | 5304024532535 |
7 | 603463150043 |
oct | 131403376613 |
9 | 34006303475 |
10 | 12013403531 |
11 | 5105286978 |
12 | 23b332114b |
13 | 1195b785cc |
14 | 81d70a723 |
15 | 4a4a1be8b |
hex | 2cc0dfd8b |
12013403531 has 8 divisors (see below), whose sum is σ = 12229047600. Its totient is φ = 11798160480.
The previous prime is 12013403513. The next prime is 12013403609. The reversal of 12013403531 is 13530431021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12013403531 is a prime.
It is a super-2 number, since 2×120134035312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12013403497 and 12013403506.
It is not an unprimeable number, because it can be changed into a prime (12013403231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39476 + ... + 159953.
It is an arithmetic number, because the mean of its divisors is an integer number (1528630950).
Almost surely, 212013403531 is an apocalyptic number.
12013403531 is a deficient number, since it is larger than the sum of its proper divisors (215644069).
12013403531 is a wasteful number, since it uses less digits than its factorization.
12013403531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200509.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 12013403531 its reverse (13530431021), we get a palindrome (25543834552).
The spelling of 12013403531 in words is "twelve billion, thirteen million, four hundred three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •