Base | Representation |
---|---|
bin | 1011101100110101010… |
… | …0010001111110111001 |
3 | 201012211221200121021012 |
4 | 2323031110101332321 |
5 | 11243133331011213 |
6 | 232202201123305 |
7 | 20344202340056 |
oct | 2731524217671 |
9 | 635757617235 |
10 | 201013141433 |
11 | 78281750375 |
12 | 32b5aa89535 |
13 | 15c561aaa50 |
14 | 9a2c89002d |
15 | 536739e4a8 |
hex | 2ecd511fb9 |
201013141433 has 8 divisors (see below), whose sum is σ = 216483360576. Its totient is φ = 185544018000.
The previous prime is 201013141387. The next prime is 201013141451. The reversal of 201013141433 is 334141310102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201013141433 - 28 = 201013141177 is a prime.
It is a super-2 number, since 2×2010131414332 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 201013141399 and 201013141408.
It is not an unprimeable number, because it can be changed into a prime (201013141493) 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, 129068 + ... + 647058.
It is an arithmetic number, because the mean of its divisors is an integer number (27060420072).
Almost surely, 2201013141433 is an apocalyptic number.
It is an amenable number.
201013141433 is a deficient number, since it is larger than the sum of its proper divisors (15470219143).
201013141433 is a wasteful number, since it uses less digits than its factorization.
201013141433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 547855.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 201013141433 its reverse (334141310102), we get a palindrome (535154451535).
The spelling of 201013141433 in words is "two hundred one billion, thirteen million, one hundred forty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •