Base | Representation |
---|---|
bin | 11011000011111… |
… | …010110001100001 |
3 | 1011122022012101022 |
4 | 123003322301201 |
5 | 1412211341001 |
6 | 113015015225 |
7 | 14152016102 |
oct | 3303726141 |
9 | 1148265338 |
10 | 454012001 |
11 | 213306a33 |
12 | 10806a515 |
13 | 730a2b71 |
14 | 444243a9 |
15 | 29cd211b |
hex | 1b0fac61 |
454012001 has 4 divisors (see below), whose sum is σ = 454078512. Its totient is φ = 453945492.
The previous prime is 454011989. The next prime is 454012037. The reversal of 454012001 is 100210454.
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, and also an emirpimes, since its reverse is a distinct semiprime: 100210454 = 2 ⋅50105227.
It is a cyclic number.
It is not a de Polignac number, because 454012001 - 26 = 454011937 is a prime.
It is a super-2 number, since 2×4540120012 = 412253794104048002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (454012501) 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, 21671 + ... + 37116.
It is an arithmetic number, because the mean of its divisors is an integer number (113519628).
Almost surely, 2454012001 is an apocalyptic number.
It is an amenable number.
454012001 is a deficient number, since it is larger than the sum of its proper divisors (66511).
454012001 is an equidigital number, since it uses as much as digits as its factorization.
454012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66510.
The product of its (nonzero) digits is 160, while the sum is 17.
The square root of 454012001 is about 21307.5573682203. The cubic root of 454012001 is about 768.5800564171.
Adding to 454012001 its reverse (100210454), we get a palindrome (554222455).
The spelling of 454012001 in words is "four hundred fifty-four million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •