Base | Representation |
---|---|
bin | 110101101111001001111… |
… | …1001110111010000110101 |
3 | 222011001100022001101220211 |
4 | 1223132103321313100311 |
5 | 1432001031212414031 |
6 | 23412510555425421 |
7 | 1361405215622551 |
oct | 153362371672065 |
9 | 28131308041824 |
10 | 7385530201141 |
11 | 2398205292694 |
12 | 9b3447155271 |
13 | 4175b62183c1 |
14 | 1b766678c861 |
15 | cc1abb14bb1 |
hex | 6b793e77435 |
7385530201141 has 8 divisors (see below), whose sum is σ = 7412954106368. Its totient is φ = 7358107554000.
The previous prime is 7385530201129. The next prime is 7385530201199. The reversal of 7385530201141 is 1411020355837.
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 7385530201141 - 225 = 7385496646709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 7385530201094 and 7385530201103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (7385530201741) 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, 12400231 + ... + 12982171.
It is an arithmetic number, because the mean of its divisors is an integer number (926619263296).
Almost surely, 27385530201141 is an apocalyptic number.
It is an amenable number.
7385530201141 is a deficient number, since it is larger than the sum of its proper divisors (27423905227).
7385530201141 is a wasteful number, since it uses less digits than its factorization.
7385530201141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 629043.
The product of its (nonzero) digits is 100800, while the sum is 40.
Adding to 7385530201141 its reverse (1411020355837), we get a palindrome (8796550556978).
The spelling of 7385530201141 in words is "seven trillion, three hundred eighty-five billion, five hundred thirty million, two hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •