Base | Representation |
---|---|
bin | 100000100000100101011… |
… | …111111011100110111111 |
3 | 21220120101010221022220111 |
4 | 200200211133323212333 |
5 | 243100224100342120 |
6 | 4430142504530451 |
7 | 320254621501165 |
oct | 40404537734677 |
9 | 7816333838814 |
10 | 2234012121535 |
11 | 791491669337 |
12 | 300b72180a27 |
13 | 13288822243c |
14 | 7a1abba7235 |
15 | 3d1a23e775a |
hex | 208257fb9bf |
2234012121535 has 8 divisors (see below), whose sum is σ = 2685627501696. Its totient is φ = 1784001060000.
The previous prime is 2234012121521. The next prime is 2234012121541. The reversal of 2234012121535 is 5351212104322.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2234012121535 - 213 = 2234012113343 is a prime.
It is a super-2 number, since 2×22340121215352 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2234012121497 and 2234012121506.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 401076591 + ... + 401082160.
It is an arithmetic number, because the mean of its divisors is an integer number (335703437712).
Almost surely, 22234012121535 is an apocalyptic number.
2234012121535 is a deficient number, since it is larger than the sum of its proper divisors (451615380161).
2234012121535 is an equidigital number, since it uses as much as digits as its factorization.
2234012121535 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 802159313.
The product of its (nonzero) digits is 14400, while the sum is 31.
Adding to 2234012121535 its reverse (5351212104322), we get a palindrome (7585224225857).
The spelling of 2234012121535 in words is "two trillion, two hundred thirty-four billion, twelve million, one hundred twenty-one thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •