Base | Representation |
---|---|
bin | 1100000011101110111… |
… | …10011010000001010111 |
3 | 1110121102202122210202221 |
4 | 12001313132122001113 |
5 | 23242012224220043 |
6 | 514200411443211 |
7 | 41635161053422 |
oct | 6016736320127 |
9 | 1417382583687 |
10 | 414321320023 |
11 | 14a792647076 |
12 | 6836b456507 |
13 | 300bb6a11c0 |
14 | 160a61dc9b9 |
15 | ab9dd4c8ed |
hex | 607779a057 |
414321320023 has 4 divisors (see below), whose sum is σ = 446192190808. Its totient is φ = 382450449240.
The previous prime is 414321320011. The next prime is 414321320027. The reversal of 414321320023 is 320023123414.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 320023123414 = 2 ⋅160011561707.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-414321320023 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 414321320023.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (414321320027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15935435373 + ... + 15935435398.
It is an arithmetic number, because the mean of its divisors is an integer number (111548047702).
Almost surely, 2414321320023 is an apocalyptic number.
414321320023 is a deficient number, since it is larger than the sum of its proper divisors (31870870785).
414321320023 is a wasteful number, since it uses less digits than its factorization.
414321320023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31870870784.
The product of its (nonzero) digits is 3456, while the sum is 25.
Adding to 414321320023 its reverse (320023123414), we get a palindrome (734344443437).
The spelling of 414321320023 in words is "four hundred fourteen billion, three hundred twenty-one million, three hundred twenty thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •