Base | Representation |
---|---|
bin | 110101100011010001… |
… | …0110001010011101001 |
3 | 101222211120002002020211 |
4 | 1223012202301103221 |
5 | 3341010014401241 |
6 | 124455204221121 |
7 | 11210545113634 |
oct | 1530642612351 |
9 | 358746062224 |
10 | 115000153321 |
11 | 44853652329 |
12 | 1a35539a7a1 |
13 | aac93b0501 |
14 | 57cd2c4c1b |
15 | 2ed107e781 |
hex | 1ac68b14e9 |
115000153321 has 8 divisors (see below), whose sum is σ = 116015668040. Its totient is φ = 113988221568.
The previous prime is 115000153291. The next prime is 115000153393. The reversal of 115000153321 is 123351000511.
It can be written as a sum of positive squares in 4 ways, for example, as 12935877696 + 102064275625 = 113736^2 + 319475^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 115000153321 - 29 = 115000152809 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 115000153292 and 115000153301.
It is not an unprimeable number, because it can be changed into a prime (115000153621) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 831246 + ... + 959671.
It is an arithmetic number, because the mean of its divisors is an integer number (14501958505).
Almost surely, 2115000153321 is an apocalyptic number.
It is an amenable number.
115000153321 is a deficient number, since it is larger than the sum of its proper divisors (1015514719).
115000153321 is a wasteful number, since it uses less digits than its factorization.
115000153321 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1791483.
The product of its (nonzero) digits is 450, while the sum is 22.
Adding to 115000153321 its reverse (123351000511), we get a palindrome (238351153832).
The spelling of 115000153321 in words is "one hundred fifteen billion, one hundred fifty-three thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.683 sec. • engine limits •