Base | Representation |
---|---|
bin | 11101001100011101100… |
… | …11010101010100100000 |
3 | 10112220020101021111020201 |
4 | 32212032303111110200 |
5 | 112413344014420222 |
6 | 2044454535314544 |
7 | 132321220345141 |
oct | 16461663252440 |
9 | 3486211244221 |
10 | 1003123201312 |
11 | 357470994301 |
12 | 1424b3b1ba54 |
13 | 7379535815b |
14 | 367a115dac8 |
15 | 1b160a44427 |
hex | e98ecd5520 |
1003123201312 has 48 divisors (see below), whose sum is σ = 2091167328600. Its totient is φ = 472035852288.
The previous prime is 1003123201309. The next prime is 1003123201319. The reversal of 1003123201312 is 2131023213001.
It can be written as a sum of positive squares in 4 ways, for example, as 413968707216 + 589154494096 = 643404^2 + 767564^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 1003123201312.
It is not an unprimeable number, because it can be changed into a prime (1003123201319) 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, 20853064 + ... + 20901112.
Almost surely, 21003123201312 is an apocalyptic number.
It is an amenable number.
1003123201312 is an abundant number, since it is smaller than the sum of its proper divisors (1088044127288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1003123201312 is a wasteful number, since it uses less digits than its factorization.
1003123201312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86453 (or 86445 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 1003123201312 its reverse (2131023213001), we get a palindrome (3134146414313).
The spelling of 1003123201312 in words is "one trillion, three billion, one hundred twenty-three million, two hundred one thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •