Base | Representation |
---|---|
bin | 11110001000010011101… |
… | …01011011111000100011 |
3 | 10122222011111111201120201 |
4 | 33010021311123320203 |
5 | 113430144020333443 |
6 | 2111331021450031 |
7 | 134536340560243 |
oct | 17041165337043 |
9 | 3588144451521 |
10 | 1035252121123 |
11 | 36a0589192a0 |
12 | 14877ba10917 |
13 | 768157c54cc |
14 | 3816c221b23 |
15 | 1bde14e934d |
hex | f109d5be23 |
1035252121123 has 4 divisors (see below), whose sum is σ = 1129365950328. Its totient is φ = 941138291920.
The previous prime is 1035252121093. The next prime is 1035252121133. The reversal of 1035252121123 is 3211212525301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1035252121123 - 213 = 1035252112931 is a prime.
It is a super-2 number, since 2×10352521211232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1035252121091 and 1035252121100.
It is not an unprimeable number, because it can be changed into a prime (1035252121133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 47056914586 + ... + 47056914607.
It is an arithmetic number, because the mean of its divisors is an integer number (282341487582).
Almost surely, 21035252121123 is an apocalyptic number.
1035252121123 is a deficient number, since it is larger than the sum of its proper divisors (94113829205).
1035252121123 is an equidigital number, since it uses as much as digits as its factorization.
1035252121123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94113829204.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 1035252121123 its reverse (3211212525301), we get a palindrome (4246464646424).
The spelling of 1035252121123 in words is "one trillion, thirty-five billion, two hundred fifty-two million, one hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •