Base | Representation |
---|---|
bin | 11101000111000101111… |
… | …00111010011011100101 |
3 | 10112121210110002021202011 |
4 | 32203202330322123211 |
5 | 112341442422001321 |
6 | 2043300503114221 |
7 | 132156610662136 |
oct | 16434274723345 |
9 | 3477713067664 |
10 | 1000240031461 |
11 | 356221470100 |
12 | 141a2a442971 |
13 | 73425c2aaa8 |
14 | 365aa289c8d |
15 | 1b04287bae1 |
hex | e8e2f3a6e5 |
1000240031461 has 24 divisors (see below), whose sum is σ = 1105777032192. Its totient is φ = 904076263200.
The previous prime is 1000240031383. The next prime is 1000240031491. The reversal of 1000240031461 is 1641300420001.
It is not a de Polignac number, because 1000240031461 - 27 = 1000240031333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1000240031491) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 21482196 + ... + 21528706.
It is an arithmetic number, because the mean of its divisors is an integer number (46074043008).
Almost surely, 21000240031461 is an apocalyptic number.
1000240031461 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1000240031461 is a deficient number, since it is larger than the sum of its proper divisors (105537000731).
1000240031461 is a wasteful number, since it uses less digits than its factorization.
1000240031461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47553 (or 47542 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 1000240031461 its reverse (1641300420001), we get a palindrome (2641540451462).
The spelling of 1000240031461 in words is "one trillion, two hundred forty million, thirty-one thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •