Base | Representation |
---|---|
bin | 11011100110110… |
… | …011011101101101 |
3 | 1012021111211002201 |
4 | 123212303131231 |
5 | 1422032011401 |
6 | 113543021501 |
7 | 14322525151 |
oct | 3346633555 |
9 | 1167454081 |
10 | 463157101 |
11 | 218492870 |
12 | 10b13a891 |
13 | 74c55574 |
14 | 45725061 |
15 | 2a9dbb01 |
hex | 1b9b376d |
463157101 has 4 divisors (see below), whose sum is σ = 505262304. Its totient is φ = 421051900.
The previous prime is 463157087. The next prime is 463157111. The reversal of 463157101 is 101751364.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 463157101 - 27 = 463156973 is a prime.
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 463157101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (463157111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21052585 + ... + 21052606.
It is an arithmetic number, because the mean of its divisors is an integer number (126315576).
Almost surely, 2463157101 is an apocalyptic number.
It is an amenable number.
463157101 is a deficient number, since it is larger than the sum of its proper divisors (42105203).
463157101 is a wasteful number, since it uses less digits than its factorization.
463157101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 42105202.
The product of its (nonzero) digits is 2520, while the sum is 28.
The square root of 463157101 is about 21521.0850330554. The cubic root of 463157101 is about 773.7062568976.
The spelling of 463157101 in words is "four hundred sixty-three million, one hundred fifty-seven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •