Base | Representation |
---|---|
bin | 110000000110100100000000… |
… | …0101101111100000000011101 |
3 | 2001111010100021102212100112122 |
4 | 1200031020000231330000131 |
5 | 420424301313040143123 |
6 | 4055520025315312325 |
7 | 155060002525140146 |
oct | 14015100055740035 |
9 | 2044110242770478 |
10 | 423114420240413 |
11 | 1128a98aa723570 |
12 | 3b5564ab2ab6a5 |
13 | 1521269855a245 |
14 | 766abc0a48acd |
15 | 33db29c8d6bc8 |
hex | 180d200b7c01d |
423114420240413 has 8 divisors (see below), whose sum is σ = 461667979493760. Its totient is φ = 384575629646880.
The previous prime is 423114420240409. The next prime is 423114420240419. The reversal of 423114420240413 is 314042024411324.
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 423114420240413 - 22 = 423114420240409 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (423114420240419) 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, 3692105045 + ... + 3692219642.
It is an arithmetic number, because the mean of its divisors is an integer number (57708497436720).
Almost surely, 2423114420240413 is an apocalyptic number.
It is an amenable number.
423114420240413 is a deficient number, since it is larger than the sum of its proper divisors (38553559253347).
423114420240413 is a wasteful number, since it uses less digits than its factorization.
423114420240413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7384329907.
The product of its (nonzero) digits is 73728, while the sum is 35.
Adding to 423114420240413 its reverse (314042024411324), we get a palindrome (737156444651737).
The spelling of 423114420240413 in words is "four hundred twenty-three trillion, one hundred fourteen billion, four hundred twenty million, two hundred forty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •