Base | Representation |
---|---|
bin | 110101111000100001010… |
… | …1110101100111101010010 |
3 | 222012222021000010102221010 |
4 | 1223301002232230331102 |
5 | 1432313224122013310 |
6 | 23430034442111350 |
7 | 1363016512133025 |
oct | 153610256547522 |
9 | 28188230112833 |
10 | 7405643157330 |
11 | 23a5796552330 |
12 | 9b731aaab556 |
13 | 419470121b02 |
14 | 1b8613a791bc |
15 | cc987744320 |
hex | 6bc42bacf52 |
7405643157330 has 32 divisors (see below), whose sum is σ = 19389320267328. Its totient is φ = 1795307432000.
The previous prime is 7405643157203. The next prime is 7405643157331. The reversal of 7405643157330 is 337513465047.
It is a super-2 number, since 2×74056431573302 (a number of 27 digits) contains 22 as substring.
It is a nialpdrome in base 15.
It is a self number, because there is not a number n which added to its sum of digits gives 7405643157330.
It is not an unprimeable number, because it can be changed into a prime (7405643157331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11220671121 + ... + 11220671780.
It is an arithmetic number, because the mean of its divisors is an integer number (605916258354).
Almost surely, 27405643157330 is an apocalyptic number.
7405643157330 is an abundant number, since it is smaller than the sum of its proper divisors (11983677109998).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7405643157330 is a wasteful number, since it uses less digits than its factorization.
7405643157330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22441342922.
The product of its (nonzero) digits is 3175200, while the sum is 48.
The spelling of 7405643157330 in words is "seven trillion, four hundred five billion, six hundred forty-three million, one hundred fifty-seven thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •