Base | Representation |
---|---|
bin | 1011110100111000110100… |
… | …0110001111110100110011 |
3 | 1201001002121200101122012121 |
4 | 2331032031012033310303 |
5 | 3201021110201331011 |
6 | 43353334115535111 |
7 | 2511311145532324 |
oct | 275161506176463 |
9 | 51032550348177 |
10 | 13003233230131 |
11 | 416370518a411 |
12 | 15601445ba497 |
13 | 734279790241 |
14 | 32d5075c044b |
15 | 17839d44ae71 |
hex | bd38d18fd33 |
13003233230131 has 16 divisors (see below), whose sum is σ = 13386311078400. Its totient is φ = 12625699600800.
The previous prime is 13003233230089. The next prime is 13003233230147. The reversal of 13003233230131 is 13103233230031.
It is a cyclic number.
It is not a de Polignac number, because 13003233230131 - 27 = 13003233230003 is a prime.
It is a super-2 number, since 2×130032332301312 (a number of 27 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 = 13003233230096 and 13003233230105.
It is not an unprimeable number, because it can be changed into a prime (13003233230231) 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, 24658140 + ... + 25179958.
It is an arithmetic number, because the mean of its divisors is an integer number (836644442400).
Almost surely, 213003233230131 is an apocalyptic number.
13003233230131 is a deficient number, since it is larger than the sum of its proper divisors (383077848269).
13003233230131 is an equidigital number, since it uses as much as digits as its factorization.
13003233230131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527130.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 13003233230131 its reverse (13103233230031), we get a palindrome (26106466460162).
The spelling of 13003233230131 in words is "thirteen trillion, three billion, two hundred thirty-three million, two hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •