Base | Representation |
---|---|
bin | 1100000100000000101… |
… | …10111001000101111001 |
3 | 1110121211011002001201112 |
4 | 12002000112321011321 |
5 | 23242313402020311 |
6 | 514223253530105 |
7 | 41641650543002 |
oct | 6020026710571 |
9 | 1417734061645 |
10 | 414470345081 |
11 | 14a859782881 |
12 | 683b1343935 |
13 | 3011351b400 |
14 | 160bbd121a9 |
15 | ababe8828b |
hex | 60805b9179 |
414470345081 has 12 divisors (see below), whose sum is σ = 456162639660. Its totient is φ = 376316066880.
The previous prime is 414470344973. The next prime is 414470345111. The reversal of 414470345081 is 180543074414.
It can be written as a sum of positive squares in 6 ways, for example, as 139281972025 + 275188373056 = 373205^2 + 524584^2 .
It is a de Polignac number, because none of the positive numbers 2k-414470345081 is a prime.
It is a super-2 number, since 2×4144703450812 (a number of 24 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (41) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (414470345381) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 20092046 + ... + 20112663.
It is an arithmetic number, because the mean of its divisors is an integer number (38013553305).
Almost surely, 2414470345081 is an apocalyptic number.
It is an amenable number.
414470345081 is a deficient number, since it is larger than the sum of its proper divisors (41692294579).
414470345081 is a wasteful number, since it uses less digits than its factorization.
414470345081 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 40204796 (or 40204783 counting only the distinct ones).
The product of its (nonzero) digits is 215040, while the sum is 41.
The spelling of 414470345081 in words is "four hundred fourteen billion, four hundred seventy million, three hundred forty-five thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •