Base | Representation |
---|---|
bin | 1111010101010010011… |
… | …0111101111100110100 |
3 | 221011220200002210000022 |
4 | 3311110212331330310 |
5 | 13303432100201140 |
6 | 321002100104312 |
7 | 25013415235010 |
oct | 3652446757464 |
9 | 834820083008 |
10 | 263412506420 |
11 | a17925468a8 |
12 | 43074395098 |
13 | 1babba6081b |
14 | ca6bc79540 |
15 | 6cba5a00b5 |
hex | 3d549bdf34 |
263412506420 has 24 divisors (see below), whose sum is σ = 632190015744. Its totient is φ = 90312859296.
The previous prime is 263412506419. The next prime is 263412506431. The reversal of 263412506420 is 24605214362.
It is a super-2 number, since 2×2634125064202 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 940758812 + ... + 940759091.
It is an arithmetic number, because the mean of its divisors is an integer number (26341250656).
Almost surely, 2263412506420 is an apocalyptic number.
263412506420 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
263412506420 is an abundant number, since it is smaller than the sum of its proper divisors (368777509324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
263412506420 is a wasteful number, since it uses less digits than its factorization.
263412506420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1881517919 (or 1881517917 counting only the distinct ones).
The product of its (nonzero) digits is 69120, while the sum is 35.
The spelling of 263412506420 in words is "two hundred sixty-three billion, four hundred twelve million, five hundred six thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •