Base | Representation |
---|---|
bin | 110000001000001010101110… |
… | …1000010010001000011001100 |
3 | 2001111220102122212221102000021 |
4 | 1200100111131002101003030 |
5 | 420441410101133433302 |
6 | 4100205230411111524 |
7 | 155111642151455560 |
oct | 14020253502210314 |
9 | 2044812585842007 |
10 | 423335012405452 |
11 | 112984409200084 |
12 | 3b5911b31425a4 |
13 | 1522a421b38654 |
14 | 76777499196a0 |
15 | 33e1dada98437 |
hex | 181055d0910cc |
423335012405452 has 12 divisors (see below), whose sum is σ = 846670024810960. Its totient is φ = 181429291030896.
The previous prime is 423335012405429. The next prime is 423335012405507. The reversal of 423335012405452 is 254504210533324.
423335012405452 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 423335012405399 and 423335012405408.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 7559553792927 + ... + 7559553792982.
Almost surely, 2423335012405452 is an apocalyptic number.
It is an amenable number.
423335012405452 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
423335012405452 is a wasteful number, since it uses less digits than its factorization.
423335012405452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15119107585920 (or 15119107585918 counting only the distinct ones).
The product of its (nonzero) digits is 1728000, while the sum is 43.
Adding to 423335012405452 its reverse (254504210533324), we get a palindrome (677839222938776).
The spelling of 423335012405452 in words is "four hundred twenty-three trillion, three hundred thirty-five billion, twelve million, four hundred five thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •