Base | Representation |
---|---|
bin | 101111110000110011010000… |
… | …1111110010001110100010001 |
3 | 2001002112102021101201010011112 |
4 | 1133201212201332101310101 |
5 | 420031300444030404023 |
6 | 4045310030431423105 |
7 | 154330631543655524 |
oct | 13741464176216421 |
9 | 2032472241633145 |
10 | 420123533450513 |
11 | 111956432042492 |
12 | 3b152909384a95 |
13 | 1505662ca97b69 |
14 | 75a61321d6bbb |
15 | 338859d283478 |
hex | 17e19a1f91d11 |
420123533450513 has 8 divisors (see below), whose sum is σ = 420305666233536. Its totient is φ = 419941407886000.
The previous prime is 420123533450461. The next prime is 420123533450611. The reversal of 420123533450513 is 315054335321024.
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 420123533450513 - 212 = 420123533446417 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (420123533450813) 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, 116296163 + ... + 119854263.
It is an arithmetic number, because the mean of its divisors is an integer number (52538208279192).
Almost surely, 2420123533450513 is an apocalyptic number.
It is an amenable number.
420123533450513 is a deficient number, since it is larger than the sum of its proper divisors (182132783023).
420123533450513 is a wasteful number, since it uses less digits than its factorization.
420123533450513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3609255.
The product of its (nonzero) digits is 648000, while the sum is 41.
Adding to 420123533450513 its reverse (315054335321024), we get a palindrome (735177868771537).
The spelling of 420123533450513 in words is "four hundred twenty trillion, one hundred twenty-three billion, five hundred thirty-three million, four hundred fifty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •