Base | Representation |
---|---|
bin | 111110001011110101111… |
… | …110111100100010101100 |
3 | 120010112012022210101221102 |
4 | 332023311332330202230 |
5 | 1030003232022123202 |
6 | 13031045500422232 |
7 | 620510651112224 |
oct | 76136576744254 |
9 | 16115168711842 |
10 | 4273324411052 |
11 | 13a8341252094 |
12 | 590247847978 |
13 | 24cc85210688 |
14 | 10ab89769084 |
15 | 7625b815d02 |
hex | 3e2f5fbc8ac |
4273324411052 has 48 divisors (see below), whose sum is σ = 8214589555200. Its totient is φ = 1936098552960.
The previous prime is 4273324411021. The next prime is 4273324411163. The reversal of 4273324411052 is 2501144233724.
It is a super-2 number, since 2×42733244110522 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a junction number, because it is equal to n+sod(n) for n = 4273324410997 and 4273324411015.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 42529352 + ... + 42629712.
It is an arithmetic number, because the mean of its divisors is an integer number (171137282400).
Almost surely, 24273324411052 is an apocalyptic number.
It is an amenable number.
4273324411052 is a deficient number, since it is larger than the sum of its proper divisors (3941265144148).
4273324411052 is a wasteful number, since it uses less digits than its factorization.
4273324411052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124766 (or 124764 counting only the distinct ones).
The product of its (nonzero) digits is 161280, while the sum is 38.
Adding to 4273324411052 its reverse (2501144233724), we get a palindrome (6774468644776).
It can be divided in two parts, 427332 and 4411052, that added together give a palindrome (4838384).
The spelling of 4273324411052 in words is "four trillion, two hundred seventy-three billion, three hundred twenty-four million, four hundred eleven thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •