Base | Representation |
---|---|
bin | 1001001110001111010100… |
… | …1011110001001100000101 |
3 | 1022220101201111121111210020 |
4 | 2103203311023301030011 |
5 | 2312114200444242131 |
6 | 33322205452045353 |
7 | 2064415336405554 |
oct | 223436513611405 |
9 | 38811644544706 |
10 | 10140236321541 |
11 | 325a4a5059017 |
12 | 11792b4763859 |
13 | 5872b2980c41 |
14 | 270b0bcb5d9b |
15 | 128b86795996 |
hex | 938f52f1305 |
10140236321541 has 8 divisors (see below), whose sum is σ = 14108154882240. Its totient is φ = 6466237654272.
The previous prime is 10140236321531. The next prime is 10140236321591. The reversal of 10140236321541 is 14512363204101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10140236321541 - 225 = 10140202767109 is a prime.
It is a super-2 number, since 2×101402363215412 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10140236321531) 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, 73479973276 + ... + 73479973413.
It is an arithmetic number, because the mean of its divisors is an integer number (1763519360280).
Almost surely, 210140236321541 is an apocalyptic number.
It is an amenable number.
10140236321541 is a deficient number, since it is larger than the sum of its proper divisors (3967918560699).
10140236321541 is a wasteful number, since it uses less digits than its factorization.
10140236321541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 146959946715.
The product of its (nonzero) digits is 17280, while the sum is 33.
Adding to 10140236321541 its reverse (14512363204101), we get a palindrome (24652599525642).
The spelling of 10140236321541 in words is "ten trillion, one hundred forty billion, two hundred thirty-six million, three hundred twenty-one thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •