Base | Representation |
---|---|
bin | 10110011011011001… |
… | …10001100000110100 |
3 | 1011002011021020011110 |
4 | 23031230301200310 |
5 | 144124444013022 |
6 | 5310452235020 |
7 | 604246551135 |
oct | 131554614064 |
9 | 34064236143 |
10 | 12041001012 |
11 | 5119916307 |
12 | 240060ba70 |
13 | 119b7bbb91 |
14 | 823251c8c |
15 | 4a716e00c |
hex | 2cdb31834 |
12041001012 has 12 divisors (see below), whose sum is σ = 28095669056. Its totient is φ = 4013667000.
The previous prime is 12041001001. The next prime is 12041001019. The reversal of 12041001012 is 21010014021.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (12).
It is a Harshad number since it is a multiple of its sum of digits (12), and also a Moran number because the ratio is a prime number: 1003416751 = 12041001012 / (1 + 2 + 0 + 4 + 1 + 0 + 0 + 1 + 0 + 1 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12041001019) 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, 501708364 + ... + 501708387.
Almost surely, 212041001012 is an apocalyptic number.
12041001012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12041001012 is an abundant number, since it is smaller than the sum of its proper divisors (16054668044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12041001012 is a wasteful number, since it uses less digits than its factorization.
12041001012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1003416758 (or 1003416756 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12041001012 its reverse (21010014021), we get a palindrome (33051015033).
The spelling of 12041001012 in words is "twelve billion, forty-one million, one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •