Base | Representation |
---|---|
bin | 100011110010111… |
… | …1010111011010111 |
3 | 10002201010101001012 |
4 | 1013211322323113 |
5 | 4424441414111 |
6 | 315104122435 |
7 | 41523243263 |
oct | 10745727327 |
9 | 3081111035 |
10 | 1201123031 |
11 | 567003569 |
12 | 29630641b |
13 | 161ac86b4 |
14 | b57430a3 |
15 | 706ad48b |
hex | 4797aed7 |
1201123031 has 8 divisors (see below), whose sum is σ = 1217556480. Its totient is φ = 1184720472.
The previous prime is 1201122983. The next prime is 1201123051. The reversal of 1201123031 is 1303211021.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1201123031 is a prime.
It is a super-2 number, since 2×12011230312 = 2885393071197253922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1201122997 and 1201123015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201123051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 76826 + ... + 91128.
It is an arithmetic number, because the mean of its divisors is an integer number (152194560).
Almost surely, 21201123031 is an apocalyptic number.
1201123031 is a deficient number, since it is larger than the sum of its proper divisors (16433449).
1201123031 is a wasteful number, since it uses less digits than its factorization.
1201123031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15445.
The product of its (nonzero) digits is 36, while the sum is 14.
The square root of 1201123031 is about 34657.2219169396. The cubic root of 1201123031 is about 1062.9899654117.
Adding to 1201123031 its reverse (1303211021), we get a palindrome (2504334052).
The spelling of 1201123031 in words is "one billion, two hundred one million, one hundred twenty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •