Base | Representation |
---|---|
bin | 11101101100100000000… |
… | …00111110000011100011 |
3 | 10121112122002112020220111 |
4 | 32312100000332003203 |
5 | 113204110244004220 |
6 | 2100421411552151 |
7 | 133500364664332 |
oct | 16662000760343 |
9 | 3545562466814 |
10 | 1020323422435 |
11 | 363797a76a89 |
12 | 1458b42bb657 |
13 | 752a69823a5 |
14 | 3755367bd19 |
15 | 1b81aabb15a |
hex | ed9003e0e3 |
1020323422435 has 32 divisors (see below), whose sum is σ = 1241423164800. Its totient is φ = 804974312448.
The previous prime is 1020323422429. The next prime is 1020323422441. The reversal of 1020323422435 is 5342243230201.
It is an interprime number because it is at equal distance from previous prime (1020323422429) and next prime (1020323422441).
It is a cyclic number.
It is not a de Polignac number, because 1020323422435 - 211 = 1020323420387 is a prime.
It is a super-2 number, since 2×10203234224352 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1020323422397 and 1020323422406.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 157624359 + ... + 157630831.
It is an arithmetic number, because the mean of its divisors is an integer number (38794473900).
Almost surely, 21020323422435 is an apocalyptic number.
1020323422435 is a deficient number, since it is larger than the sum of its proper divisors (221099742365).
1020323422435 is a wasteful number, since it uses less digits than its factorization.
1020323422435 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7807.
The product of its (nonzero) digits is 34560, while the sum is 31.
Adding to 1020323422435 its reverse (5342243230201), we get a palindrome (6362566652636).
The spelling of 1020323422435 in words is "one trillion, twenty billion, three hundred twenty-three million, four hundred twenty-two thousand, four hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •