Base | Representation |
---|---|
bin | 110001000110110000… |
… | …0011101000011000111 |
3 | 101002012020000012102202 |
4 | 1202031200131003013 |
5 | 3211432021411101 |
6 | 120240010225115 |
7 | 10422142226630 |
oct | 1421540350307 |
9 | 332166005382 |
10 | 105453310151 |
11 | 407a470a7a2 |
12 | 1853012519b |
13 | 9c37556897 |
14 | 5165402887 |
15 | 2b22d8536b |
hex | 188d81d0c7 |
105453310151 has 4 divisors (see below), whose sum is σ = 120518068752. Its totient is φ = 90388551552.
The previous prime is 105453310097. The next prime is 105453310223. The reversal of 105453310151 is 151013354501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 151013354501 = 593 ⋅254659957.
It is a cyclic number.
It is not a de Polignac number, because 105453310151 - 26 = 105453310087 is a prime.
It is a super-2 number, since 2×1054533101512 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105453310051) 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, 7532379290 + ... + 7532379303.
It is an arithmetic number, because the mean of its divisors is an integer number (30129517188).
Almost surely, 2105453310151 is an apocalyptic number.
105453310151 is a deficient number, since it is larger than the sum of its proper divisors (15064758601).
105453310151 is an equidigital number, since it uses as much as digits as its factorization.
105453310151 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15064758600.
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 105453310151 its reverse (151013354501), we get a palindrome (256466664652).
The spelling of 105453310151 in words is "one hundred five billion, four hundred fifty-three million, three hundred ten thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •