Base | Representation |
---|---|
bin | 1000010010111111000… |
… | …1011110100111110001 |
3 | 111121220112112120200111 |
4 | 2010233301132213301 |
5 | 4313403031423101 |
6 | 145251352421321 |
7 | 13204106040343 |
oct | 2045761364761 |
9 | 447815476614 |
10 | 142535420401 |
11 | 554a3590000 |
12 | 2375a9a7841 |
13 | 10596c4365a |
14 | 6c8225d293 |
15 | 3a935e7251 |
hex | 212fc5e9f1 |
142535420401 has 10 divisors (see below), whose sum is σ = 156788005010. Its totient is φ = 129577641600.
The previous prime is 142535420387. The next prime is 142535420507. The reversal of 142535420401 is 104024535241.
It can be written as a sum of positive squares in only one way, i.e., 142521350400 + 14070001 = 377520^2 + 3751^2 .
It is a de Polignac number, because none of the positive numbers 2k-142535420401 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (142535420801) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 4853040 + ... + 4882321.
It is an arithmetic number, because the mean of its divisors is an integer number (15678800501).
Almost surely, 2142535420401 is an apocalyptic number.
142535420401 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
142535420401 is a deficient number, since it is larger than the sum of its proper divisors (14252584609).
142535420401 is an frugal number, since it uses more digits than its factorization.
142535420401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9735405 (or 9735372 counting only the distinct ones).
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 142535420401 its reverse (104024535241), we get a palindrome (246559955642).
The spelling of 142535420401 in words is "one hundred forty-two billion, five hundred thirty-five million, four hundred twenty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •