Base | Representation |
---|---|
bin | 101111011000000010011111… |
… | …0110101111110101100000001 |
3 | 2000122111001211011012112100022 |
4 | 1132300010332311332230001 |
5 | 414110021041043412233 |
6 | 4034142350505503225 |
7 | 153530021265631154 |
oct | 13660047665765401 |
9 | 2018431734175308 |
10 | 416720256232193 |
11 | 11086408284a821 |
12 | 3a8a32167a1b15 |
13 | 14b6a722992bb4 |
14 | 74c9521bb1c9b |
15 | 3329cb4593398 |
hex | 17b013ed7eb01 |
416720256232193 has 8 divisors (see below), whose sum is σ = 420487684531200. Its totient is φ = 412954225098688.
The previous prime is 416720256232187. The next prime is 416720256232331. The reversal of 416720256232193 is 391232652027614.
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 416720256232193 - 26 = 416720256232129 is a prime.
It is a super-3 number, since 3×4167202562321933 (a number of 45 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (416720256232153) 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, 348692153 + ... + 349885206.
It is an arithmetic number, because the mean of its divisors is an integer number (52560960566400).
Almost surely, 2416720256232193 is an apocalyptic number.
It is an amenable number.
416720256232193 is a deficient number, since it is larger than the sum of its proper divisors (3767428299007).
416720256232193 is a wasteful number, since it uses less digits than its factorization.
416720256232193 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 698582751.
The product of its (nonzero) digits is 6531840, while the sum is 53.
The spelling of 416720256232193 in words is "four hundred sixteen trillion, seven hundred twenty billion, two hundred fifty-six million, two hundred thirty-two thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •