Base | Representation |
---|---|
bin | 10001111011011111000… |
… | …100011100011101111001 |
3 | 11100210021101102010201100 |
4 | 101323133010130131321 |
5 | 130141321400143001 |
6 | 2342004222042013 |
7 | 155005443546111 |
oct | 21733704343571 |
9 | 4323241363640 |
10 | 1232103131001 |
11 | 435594107616 |
12 | 17a958a19309 |
13 | 8c2575c5b02 |
14 | 438c3dd6041 |
15 | 220b3299586 |
hex | 11edf11c779 |
1232103131001 has 24 divisors (see below), whose sum is σ = 1799494524360. Its totient is φ = 812287872000.
The previous prime is 1232103130997. The next prime is 1232103131093. The reversal of 1232103131001 is 1001313012321.
1232103131001 is a `hidden beast` number, since 1 + 2 + 321 + 0 + 31 + 310 + 0 + 1 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 879919041600 + 352184089401 = 938040^2 + 593451^2 .
It is not a de Polignac number, because 1232103131001 - 22 = 1232103130997 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1232103131101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 63960 + ... + 1571081.
It is an arithmetic number, because the mean of its divisors is an integer number (74978938515).
Almost surely, 21232103131001 is an apocalyptic number.
It is an amenable number.
1232103131001 is a deficient number, since it is larger than the sum of its proper divisors (567391393359).
1232103131001 is a wasteful number, since it uses less digits than its factorization.
1232103131001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1635977 (or 1635974 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1232103131001 its reverse (1001313012321), we get a palindrome (2233416143322).
The spelling of 1232103131001 in words is "one trillion, two hundred thirty-two billion, one hundred three million, one hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •