Base | Representation |
---|---|
bin | 100011110011011… |
… | …1110110010111111 |
3 | 10002201122111101012 |
4 | 1013212332302333 |
5 | 4430024313043 |
6 | 315114105435 |
7 | 41525511614 |
oct | 10746766277 |
9 | 3081574335 |
10 | 1201401023 |
11 | 567183409 |
12 | 29641b27b |
13 | 161b950a4 |
14 | b57b650b |
15 | 70715a18 |
hex | 479becbf |
1201401023 has 4 divisors (see below), whose sum is σ = 1201541328. Its totient is φ = 1201260720.
The previous prime is 1201401017. The next prime is 1201401031. The reversal of 1201401023 is 3201041021.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3201041021 = 73 ⋅43849877.
It is a cyclic number.
It is not a de Polignac number, because 1201401023 - 224 = 1184623807 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1201400989 and 1201401007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1201401073) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56411 + ... + 74732.
It is an arithmetic number, because the mean of its divisors is an integer number (300385332).
Almost surely, 21201401023 is an apocalyptic number.
1201401023 is a deficient number, since it is larger than the sum of its proper divisors (140305).
1201401023 is an equidigital number, since it uses as much as digits as its factorization.
1201401023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140304.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1201401023 is about 34661.2322775749. The cubic root of 1201401023 is about 1063.0719664236.
Adding to 1201401023 its reverse (3201041021), we get a palindrome (4402442044).
The spelling of 1201401023 in words is "one billion, two hundred one million, four hundred one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •