Base | Representation |
---|---|
bin | 110000111010100000… |
… | …0000000011110111001 |
3 | 101001010120100011121010 |
4 | 1201311000000132321 |
5 | 3210111242320403 |
6 | 120131121504133 |
7 | 10406020361136 |
oct | 1416500003671 |
9 | 331116304533 |
10 | 105042151353 |
11 | 40603613037 |
12 | 184364a2049 |
13 | 9ba0309159 |
14 | 512697558d |
15 | 2aebc1a603 |
hex | 18750007b9 |
105042151353 has 8 divisors (see below), whose sum is σ = 140057742688. Its totient is φ = 70027330464.
The previous prime is 105042151349. The next prime is 105042151397. The reversal of 105042151353 is 353151240501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105042151353 - 22 = 105042151349 is a prime.
It is a super-2 number, since 2×1050421513532 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 105042151353.
It is not an unprimeable number, because it can be changed into a prime (105042151153) 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, 321726 + ... + 559992.
It is an arithmetic number, because the mean of its divisors is an integer number (17507217836).
Almost surely, 2105042151353 is an apocalyptic number.
It is an amenable number.
105042151353 is a deficient number, since it is larger than the sum of its proper divisors (35015591335).
105042151353 is a wasteful number, since it uses less digits than its factorization.
105042151353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 385223.
The product of its (nonzero) digits is 9000, while the sum is 30.
Adding to 105042151353 its reverse (353151240501), we get a palindrome (458193391854).
The spelling of 105042151353 in words is "one hundred five billion, forty-two million, one hundred fifty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •