Base | Representation |
---|---|
bin | 1011110110100001000111… |
… | …0110010000101110001001 |
3 | 1201010202212211122201122002 |
4 | 2331220101312100232021 |
5 | 3202000424413304001 |
6 | 43414244200240345 |
7 | 2513322014132150 |
oct | 275502166205611 |
9 | 51122784581562 |
10 | 13031230213001 |
11 | 4174571805a90 |
12 | 15656587700b5 |
13 | 736abbb928b0 |
14 | 330a019c6597 |
15 | 178e8b2b846b |
hex | bda11d90b89 |
13031230213001 has 16 divisors (see below), whose sum is σ = 17496476930688. Its totient is φ = 9373112640000.
The previous prime is 13031230212937. The next prime is 13031230213037. The reversal of 13031230213001 is 10031203213031.
It is a cyclic number.
It is not a de Polignac number, because 13031230213001 - 26 = 13031230212937 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13031230213061) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6509105000 + ... + 6509107001.
It is an arithmetic number, because the mean of its divisors is an integer number (1093529808168).
Almost surely, 213031230213001 is an apocalyptic number.
13031230213001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13031230213001 is a deficient number, since it is larger than the sum of its proper divisors (4465246717687).
13031230213001 is a wasteful number, since it uses less digits than its factorization.
13031230213001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13018212032.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 13031230213001 its reverse (10031203213031), we get a palindrome (23062433426032).
It can be divided in two parts, 13031230 and 213001, that added together give a palindrome (13244231).
The spelling of 13031230213001 in words is "thirteen trillion, thirty-one billion, two hundred thirty million, two hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •