Base | Representation |
---|---|
bin | 1000001001111011000… |
… | …1000010111000000011 |
3 | 111101121222210000210200 |
4 | 2002132301002320003 |
5 | 4243412232013220 |
6 | 144210125100243 |
7 | 13056605353044 |
oct | 2023661027003 |
9 | 441558700720 |
10 | 140102610435 |
11 | 544652a8957 |
12 | 231a00b7683 |
13 | 10299c0aa28 |
14 | 6ad10dc8cb |
15 | 399ec3e890 |
hex | 209ec42e03 |
140102610435 has 96 divisors (see below), whose sum is σ = 262077603840. Its totient is φ = 69064579584.
The previous prime is 140102610433. The next prime is 140102610463. The reversal of 140102610435 is 534016201041.
It is a happy number.
140102610435 is a `hidden beast` number, since 1 + 4 + 0 + 1 + 0 + 2 + 610 + 43 + 5 = 666.
It is not a de Polignac number, because 140102610435 - 21 = 140102610433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 140102610399 and 140102610408.
It is not an unprimeable number, because it can be changed into a prime (140102610433) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 3824727 + ... + 3861183.
It is an arithmetic number, because the mean of its divisors is an integer number (2729975040).
Almost surely, 2140102610435 is an apocalyptic number.
140102610435 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
140102610435 is a deficient number, since it is larger than the sum of its proper divisors (121974993405).
140102610435 is a wasteful number, since it uses less digits than its factorization.
140102610435 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 36617 (or 36614 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 140102610435 its reverse (534016201041), we get a palindrome (674118811476).
The spelling of 140102610435 in words is "one hundred forty billion, one hundred two million, six hundred ten thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •