Base | Representation |
---|---|
bin | 11101111110101101110… |
… | …11100011110101001111 |
3 | 10122110212122202102121000 |
4 | 32333112323203311033 |
5 | 113334122344334411 |
6 | 2105120044511343 |
7 | 134264626026612 |
oct | 16772673436517 |
9 | 3573778672530 |
10 | 1030103121231 |
11 | 3679563a2488 |
12 | 14778354b553 |
13 | 761a4b28002 |
14 | 37c00456179 |
15 | 1bbde45e956 |
hex | efd6ee3d4f |
1030103121231 has 64 divisors (see below), whose sum is σ = 1622979072000. Its totient is φ = 643884098400.
The previous prime is 1030103121209. The next prime is 1030103121241. The reversal of 1030103121231 is 1321213010301.
1030103121231 is a `hidden beast` number, since 10 + 301 + 0 + 3 + 121 + 231 = 666.
It is not a de Polignac number, because 1030103121231 - 211 = 1030103119183 is a prime.
It is a super-4 number, since 4×10301031212314 (a number of 49 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1030103121241) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 104563456 + ... + 104573306.
It is an arithmetic number, because the mean of its divisors is an integer number (25359048000).
Almost surely, 21030103121231 is an apocalyptic number.
1030103121231 is a deficient number, since it is larger than the sum of its proper divisors (592875950769).
1030103121231 is a wasteful number, since it uses less digits than its factorization.
1030103121231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11961 (or 11955 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1030103121231 its reverse (1321213010301), we get a palindrome (2351316131532).
The spelling of 1030103121231 in words is "one trillion, thirty billion, one hundred three million, one hundred twenty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •